References

  1. R. Alur, P. Čern\`y & S. Chaudhuri (2007): Model checking on trees with path equivalences. Tools and Algorithms for the Construction and Analysis of Systems, pp. 664–678, doi:10.1007/978-3-540-71209-1_51.
  2. R. Alur, T.A. Henzinger & O. Kupferman (2002): Alternating-time temporal logic. Journal of the ACM (JACM) 49(5), pp. 672–713, doi:10.1145/585265.585270.
  3. K.R. Apt & E. Grädel (2011): Lectures in Game Theory for Computer Scientists. Cambridge University Press, doi:10.1017/CBO9780511973468.
  4. A. Arnold, A. Vincent & I. Walukiewicz (2003): Games for synthesis of controllers with partial observation. Theoretical Computer Science 1(303), pp. 7–34, doi:10.1016/S0304-3975(02)00442-5. Available at http://www.labri.fr/Perso/~igw/Papers/igw-synthesis.ps.
  5. J. Benthem (2005): The Epistemic Logic of IF Games. The Philosophy of Jaakko Hintikka 30.
  6. J. Berstel (1979): Transductions and context-free languages 4. Teubner Stuttgart.
  7. Dietmar Berwanger & Laurent Doyen (2008): On the Power of Imperfect Information. In: Ramesh Hariharan, Madhavan Mukund & V. Vinay: FSTTCS, LIPIcs 2. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 73–82. Available at http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2008.1742.
  8. K. Chatterjee, L. Doyen, T. Henzinger & J.F. Raskin (2006): Algorithms for omega-regular games with imperfect information. In: Computer Science Logic. Springer, pp. 287–302, doi:10.1007/11874683_19.
  9. C. Dima, C. Enea & D. Guelev (2010): Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions. Electronic Proceedings in Theoretical Computer Science 25, doi:10.4204.
  10. E. Allen Emerson & Charanjit S. Jutla (1991): Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). In: FOCS. IEEE Computer Society, pp. 368–377. Available at http://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185392.
  11. R. Fagin, J.Y. Halpern & M.Y. Vardi (1991): A model-theoretic analysis of knowledge. Journal of the ACM (JACM) 38(2), pp. 382–428, doi:10.1145/103516.128680.
  12. Dov M. Gabbay, Amir Pnueli, Saharon Shelah & Jonathan Stavi (1980): On the Temporal Basis of Fairness. In: Paul W. Abrahams, Richard J. Lipton & Stephen R. Bourne: POPL. ACM Press, pp. 163–173. Available at http://doi.acm.org/10.1145/567446.567462.
  13. E. Grädel, W. Thomas & T. Wilke (2002): Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001]. Lecture Notes in Computer Science 2500. Springer.
  14. Joseph Y. Halpern, Ron van der Meyden & Moshe Y. Vardi (2004): Complete Axiomatizations for Reasoning about Knowledge and Time. SIAM J. Comput. 33(3), pp. 674–703. Available at http://dx.doi.org/10.1137/S0097539797320906.
  15. J.Y. Halpern & M.Y. Vardi (1989): The complexity of reasoning about knowledge and time. 1. Lower bounds. Journal of Computer and System Sciences 38(1), pp. 195–237, doi:10.1145/12130.12161.
  16. J. Hintikka (1962): Knowledge and belief 13. Cornell University Press Ithaca.
  17. W. van der Hoek & M. Wooldridge (2003): Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica 75(1), pp. 125–157, doi:10.1023/A:1026185103185.
  18. W. Jamroga & N. Bulling (2011): Comparing variants of strategic ability. In: Proceedings of the Twenty-Second international joint conference on Artificial Intelligence-Volume Volume One. AAAI Press, pp. 252–257, doi:10.1023/A:1026171312755.
  19. Wojciech Jamroga & Wiebe van der Hoek (2004): Agents that Know How to Play. Fundamenta Informaticae 63(2-3), pp. 185–219. Available at http://iospress.metapress.com/content/xh738axb47d8rchf/.
  20. Richard E. Ladner & John H. Reif (1986): The Logic of Distributed Protocols. In: Joseph Y. Halpern: TARK. Morgan Kaufmann, pp. 207–222.
  21. D. Lehmann (1984): Knowledge, common knowledge and related puzzles (Extended Summary). In: Proceedings of the third annual ACM symposium on Principles of distributed computing. ACM, pp. 62–67, doi:10.1145/800222.806736.
  22. Bastien Maubert & Sophie Pinchinat (2012): Uniform Strategies. Rapport de recherche RR-8144. INRIA. Available at http://hal.inria.fr/hal-00760370.
  23. Bastien Maubert, Sophie Pinchinat & Laura Bozzelli (2011): Opacity Issues in Games with Imperfect Information. In: Giovanna D'Agostino & Salvatore La Torre: GandALF, EPTCS 54, pp. 87–101, doi:10.4204/EPTCS.54.7.
  24. R. Parikh & R. Ramanujam (1985): Distributed processes and the logic of knowledge. Logics of Programs, pp. 256–268, doi:10.1007/3-540-15648-8_21.
  25. A. Pnueli & R. Rosner (1989): On the Synthesis of an Asynchronous Reactive Module. In: Proc. 16th Int. Coll. on Automata, Languages and Programming, ICALP'89, Stresa, Italy, LNCS 372. Springer-Verlag, pp. 652–671, doi:10.1007/BFb0035790.
  26. J.H. Reif (1984): The complexity of two-player games of incomplete information. Journal of computer and system sciences 29(2), pp. 274–301, doi:10.1016/0022-0000(84)90034-5.
  27. JM Sato (1977): A study of Kripke style methods for some modal logic by Gentzen's sequential method. Technical Report. Technical report, Publication Research Institute for Mathematical Science.
  28. J. Väänänen (2007): Dependence Logic.
  29. J. Van Benthem (2001): Games in Dynamic-Epistemic Logic. Bulletin of Economic Research 53(4), pp. 219–248, doi:10.1111/1467-8586.00133.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org