ATL satisfiability is indeed EXPTIME-complete

Journal of Logic and Computation

Volumn 16, Issue 6, 2006, Pages 765-787

  Walther, Dirk ^a   Lutz, Carsten ^b   Wolter, Frank ^a   Wooldridge, Michael ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; OPEN SYSTEMS; PROBLEM SOLVING; SPECIFICATIONS;

ALTERNATING-TIME TEMPORAL LOGIC (ATL); SATISFIABILITY PROBLEM; VAN DRIMMELEN'S CONSTRUCTION;

FORMAL LOGIC;

EID: 33750350599     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exl009     Document Type: Article

References (15)

1. R. Alur, T. A. Henzinger and O. Kupferman. Alternating-time temporal logic. In FOCS '97: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pp. 100-109, Washington, DC, USA, October 1997. IEEE Computer Society.
2. R. Alur, T. A. Henzinger and O. Kupferman. Alternating-time temporal logic. Lecture Notes in Computer Science, 1536, 23-60, 1998.
3. R. Alur, T. A. Henzinger and O. Kupferman. Alternating-time temporal logic. J. ACM, 49(5), 672-713, 2002.
4. R. Alur, T. A. Henzinger, F. Y. C. Mang, S. Qadeer, S. K. Rajamani and S. Taşiran. Mocha: Modularity in model checking. In CAV '98: Proceedings of the 10th International Conference on Computer-aided Verification (LNCS Volume 1427), pp. 521-525. London, UK, 1998, Springer Verlag.
5. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science (vol. B): Formal Models and Semantics, pp. 995-1072. MIT Press, Cambridge, MA, USA, 1990.
6. E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. In STOC '82: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 169-180, San Francisco, California, USA, 1982. ACM Press.
7. V. Goranko and W. Jamroga. Comparing semantics of logics for multi-agent systems. Synthese, 139(2), 241-280, 2004.
8. V. Goranko and G. van Drimmelen. Complete axiomatization and decidability of alternating-time temporal logic. Theoretical Computer Science, 353(1-3), 93-117, 2006.
9. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3), 319-380, 1992.
10. W. Hoek and M. Wooldridge. Time, knowledge, and cooperation: Alternating-time temporal epistemic logic and its applications. Studia Logica, 75(1), 125-157, 2003.
11. M. Pauly. Logic for Social Software. PhD thesis, University of Amsterdam, 2001. ILLC Dissertation Series, 2001-10.
12. M. Pauly and M. Wooldridge. Logic for mechanism design - a manifesto. In Proceedings of the 2003 Workshop on Game Theory and Decision Theory in Agent Systems (GTDT-2003), Melbourne, Australia, 2003.
13. E. Spaan. Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, 1993.
14. G. van Drimmelen. Satisfiability in alternating-time temporal logic. In LICS '03: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, 22-25 June 2003, Ottawa, Canada, pp. 208-217, Washington, DC, USA, 2003. IEEE Computer Society.
15. D. Walther. Satisfiability of ATEL with distributed knowledge is ExpTime-complete. Technical Report, University of Liverpool, 2005.