AgentSpeak(L): BDI agents speak out in a logical computable language
MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
Dynamic Logic
MSPASS: Modal Reasoning by Translation and First-Order Resolution
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Agent programming in dribble: from beliefs to goals using plans
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology)
Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology)
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Goals in the context of BDI plan failure and planning
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
2APL: a practical agent programming language
Autonomous Agents and Multi-Agent Systems
Suspending and resuming tasks in BDI agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A practical agent programming language
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
DALT'09 Proceedings of the 7th international conference on Declarative Agent Languages and Technologies
Hi-index | 5.23 |
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.