Handbook of theoretical computer science (vol. B)
Alternating-time temporal logic
Journal of the ACM (JACM)
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Agents, beliefs, and plausible behavior in a temporal setting
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Reasoning about strategies of multi-agent programs
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A logic for knowledge, correctness, and real time
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Reasoning about normative update
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL*, but still allows for expressing some natural properties of agents. It has been believed that verification with ATL+ is Δ3P -complete for both memoryless agents and players who can memorize the whole history of the game. In this paper, we show that the latter result is not correct. That is, we prove that model checking ATL+ for agents that use strategies with memory is in fact PSPACE-complete. On a more optimistic note, we show that fairness constraints can be added to ATL+ without further increasing the complexity of model checking, which makes ATL+ an attractive alternative to the full language of ATL*.