On the logic of cooperation and propositional control
Artificial Intelligence
A logic for strategic reasoning
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
On the complexity of practical ATL model checking
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Alternating-time temporal logic with explicit strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
ATL* Satisfiability Is 2EXPTIME-Complete
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Tableau-based decision procedures for logics of strategic ability in multiagent systems
ACM Transactions on Computational Logic (TOCL)
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On the logic of cooperation and propositional control
Artificial Intelligence
A generic constructive solution for concurrent games with expressive constraints on strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Distributed synthesis for alternating-time logics
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Satisfiability and finite model property for the alternating-time µ-calculus
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
Alternating-time Temporal Logic (ATL) is a branching-timetemporal logic that naturally describes computationsof multi-agent distributed systems and multi-player games.In particular, ATL explicitly allows for the expressionof coalitional ability in such situations. We present anautomata-based decision procedure for ATL, by translatingthe satisfiability problem for ATL to the nonemptinessproblem for alternating automata on infinite trees. The keyresult that enables this translation is a bounded-branchingtree model theorem for ATL, proving that a satisfiable formulais also satisfiable in a tree model of bounded branchingdegree. It follows that ATL is decidable in exponentialtime, which is also the optimal complexity: satisfiability inCTL, a fragment of ATL, is EXPTIME-complete. The paperthus answers a fundamental logical question about ATLand provides an example of how alternation in automatamay elegantly express game-like transitions.