The complexity of PDL with interleaving
Theoretical Computer Science
Modal logic
The cognitive agents specification language and verification environment for multiagent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Dynamic Logic
Agent Modelling in METATEM and DESIRE
ATAL '97 Proceedings of the 4th International Workshop on Intelligent Agents IV, Agent Theories, Architectures, and Languages
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Verifying Multi-agent Programs by Model Checking
Autonomous Agents and Multi-Agent Systems
Prototyping 3APL in the Maude term rewriting language
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A grounded specification language for agent programs
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
A Verification Framework for Normative Multi-Agent Systems
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Agent logics as program logics: grounding KARO
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
A practical agent programming language
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Reactive reasoning and planning
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
ProMAS'05 Proceedings of the Third international conference on Programming Multi-Agent Systems
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL designed for the implementation of cognitive agents with beliefs, goals and plans. The logics are variants of PDL, and allow us to prove safety and liveness properties of SimpleAPL agent programs under different deliberation strategies. We show how to axiomatise different deliberation strategies for SimpleAPL programs, and, for each strategy we prove a correspondence between the operational semantics of SimpleAPL and the models of the corresponding logic. We illustrate the utility of our approach with an example in which we show how to verify correctness properties for a simple agent program under different deliberation strategies.