Intention is choice with commitment
Artificial Intelligence
Handbook of theoretical computer science (vol. B)
Reasoning about knowledge
Dynamic Logic
Alternating-time temporal logic
Journal of the ACM (JACM)
Verifying Multi-agent Programs by Model Checking
Autonomous Agents and Multi-Agent Systems
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)
2APL: a practical agent programming language
Autonomous Agents and Multi-Agent Systems
Toward a programming theory for rational agents
Autonomous Agents and Multi-Agent Systems
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Modules as policy-based intentions: modular agent programming in GOAL
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Verifying agents with memory is harder than it seemed
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Reasoning about agent programs using ATL-Like logics
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Using strategic logics to reason about agent programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent programs executed concurrently. We choose alternating-time temporal logic (ATL) for expressing properties of such programs. However, the original ATL is based on a synchronous model of multi-agent computation while most (if not all) multi-agent programming frameworks use asynchronous semantics where activities of different agents are interleaved. Moreover, unlike in ATL, our agent programs do not have perfect information about the current global state of the system. They are not appropriate subjects for modal epistemic logic either (since they do not know the global model of the system). We begin by adapting the semantics of ATL to the situation at hand; then, we consider the verification problem in the new setting and present some preliminary results.