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
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the complexity of practical ATL model checking
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Agents, beliefs, and plausible behavior in a temporal setting
Proceedings of the 6th international joint conference on Autonomous agents and multiagent 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
Reasoning about strategies of multi-agent programs
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Do agents make model checking explode (computationally)?
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
A logic for knowledge, correctness, and real time
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Verifying normative behaviour via normative mechanism design
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Bounded planning for strategic goals with incomplete information and perfect recall
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
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 ΔP3-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*.