Reasoning about plan revision in BDI agent programs |
| |
Authors: | Natasha Alechina Mehdi DastaniBrian Logan John-Jules Ch. Meyer |
| |
Affiliation: | a School of Computer Science, University of Nottingham, Nottingham NG8 1BB, UKb Department of Information and Computing Sciences, Universiteit Utrecht, 3584CH Utrecht, The Netherlands |
| |
Abstract: | Facilities for handling plan execution failures are essential for agents which must cope with the effects of nondeterministic actions, and some form of failure handling can be found in most mature agent programming languages and platforms. While such features simplify the development of more robust agents, they make it hard to reason about the execution of agent programs, e.g., to verify their correctness. In this paper, we present an approach to the verification of agent programs which admit exceptional executions. We consider executions of the BDI-based agent programming language 3APL in which plans containing non-executable actions can be revised using plan revision rules, and present a logic for reasoning about normal and exceptional executions of 3APL programs. We provide a complete axiomatization for the logic and, using a simple example, show how to express properties of 3APL programs as formulas of the logic. |
| |
Keywords: | Formalisms Logics |
本文献已被 ScienceDirect 等数据库收录! |
|