JAMROGA, Wojciech ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
T. Ågotnes, V. Goranko, and W. Jamroga. Alternating-time temporal logics with irrevocable strategies. In D. Samet, editor, Proceedings of TARK XI, pages 15-24, 2007.
T. Agotnes and D. Walther. A logic of strategic ability under bounded memory. Journal of Logic, Language and Information, 18(1):55-77, 2009.
R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time Temporal Logic. Journal of the ACM, 49:672-713, 2002.
H. Ghaderi, H. Levesque, and Y. Lespérance. A logical theory of coordination and joint ability. In Proceedings of AAAI'07, pages 421-426, 2007.
V. Goranko and G. van Drimmelen. Complete axiomatization and decidability of alternating-time temporal logic. Theoretical Computer Science, 353(1):93-117, 2006. (Pubitemid 43277729)
A. Harding, M. Ryan, and P. Schobbens. Approximating ATL*in ATL. In VMCAI '02, pages 289-301. Springer-Verlag, 2002.
W. Jamroga. Some remarks on alternating temporal epistemic logic. In Proceedings of FAMAS 2003, pages 133-140, 2003.
W. Jamroga and J. Dix. Model checking abilities of agents: A closer look. Theory of Computing Systems, 42(3):366-410, 2008.
W. Jamroga and W. van der Hoek. Agents that know how to play. Fundamenta Informaticae, 63(2-3):185-219, 2004. (Pubitemid 41218159)
F. Laroussinie, N. Markey, and G. Oreiby. On the expressiveness and complexity of ATL. LMCS, 4:7, 2008.
S. Schewe. ATL*satisfiability is 2ExpTime-complete. In Proceedings of ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pages 373-385. Springer-Verlag, 2008.
P. Y. Schobbens. Alternating-time logic with imperfect recall. ENTCS, 85(2):82-93, 2004.
W. van der Hoek, A. Lomuscio, and M. Wooldridge. On the complexity of practical ATL model checking. In Proceedings of AAMAS'06, pages 201-208, 2006.
W. van der Hoek and M.Wooldridge. Cooperation, knowledge and time: Alternating-time Temporal Epistemic Logic and its applications. Studia Logica, 75(1):125-157, 2003.
D. Walther, C. Lutz, F. Wolter, and M. Wooldridge. ATL satisfiability is indeed EXPTIME-complete. Journal of Logic and Computation, 16(6):765-787, 2006.
