References

1. Guillaume Aucher & Thomas Bolander (2013): Undecidability in Epistemic Planning. In: IJCAI. Available at http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6903.
2. Guillaume Aucher & Andreas Herzig (2011): Exploring the power of converse events. In: Dynamic formal epistemology. Springer, pp. 51–74, doi:10.1007/978-94-007-0074-1_4.
3. Pablo Barceló, Diego Figueira & Leonid Libkin (2013): Graph Logics with Rational Relations. Logical Methods in Computer Science 9(3). Available at http://dx.doi.org/10.2168/LMCS-9(3:1)2013, http://arxiv.org/abs/1304.4150.
4. Johan van Benthem, Jelle Gerbrandy, Tomohiro Hoshi & Eric Pacuit (2009): Merging frameworks for interaction. Journal of Philosophical Logic 38(5), pp. 491–526, doi:10.1007/s10992-008-9099-x.
5. Julien Bernet, David Janin & Igor Walukiewicz (2002): Permissive strategies: from parity games to safety games. ITA 36(3), pp. 261–275. Available at http://dx.doi.org/10.1051/ita:2002013.
6. Jean Berstel (1979): Transductions and context-free languages 4. Teubner Stuttgart, doi:10.1007/978-3-663-09367-1.
7. Thomas Bolander & Mikkel Birkegaard Andersen (2011): Epistemic planning for single and multi-agent systems. Journal of Applied Non-Classical Logics 21(1), pp. 9–34. Available at http://dx.doi.org/10.3166/jancl.21.9-34.
8. C.C. Elgot & J.E. Mezei (1965): On relations defined by generalized finite automata. IBM Journal of Research and Development 9(1), pp. 47–68, doi:10.1147/rd.91.0047.
9. Malik Ghallab, Dana S. Nau & Paolo Traverso (2004): Automated planning - theory and practice. Elsevier.
10. Tomohiro Hoshi & Audrey Yap (2009): Dynamic epistemic logic with branching temporal structures. Synthese 169(2), pp. 259–281. Available at http://dx.doi.org/10.1007/s11229-009-9552-6.
11. Benedikt Löwe, Eric Pacuit & Andreas Witzel (2011): DEL Planning and Some Tractable Cases. In: Hans P. van Ditmarsch, Jérôme Lang & Shier Ju: LORI, Lecture Notes in Computer Science 6953. Springer, pp. 179–192. Available at http://dx.doi.org/10.1007/978-3-642-24130-7_13.
12. Bastien Maubert & Sophie Pinchinat (2013): Jumping Automata for Uniform Strategies. In: FSTTCS'13, pp. 287–298, doi:10.4230/LIPIcs.FSTTCS.2013.287.
13. Bastien Maubert & Sophie Pinchinat (2014): A General Notion of Uniform Strategies. International Game Theory Review 16(01), doi:10.1142/S0219198914400040.
14. Bastien Maubert, Sophie Pinchinat & Laura Bozzelli (2013): The Complexity of Synthesizing Uniform Strategies. In: Fabio Mogavero, Aniello Murano & Moshe Y. Vardi: SR, EPTCS 112, pp. 115–122. Available at http://dx.doi.org/10.4204/EPTCS.112.17.
15. 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.
16. Stéphane Riedweg & Sophie Pinchinat (2003): Quantified Mu-Calculus for Control Synthesis. In: Branislav Rovan & Peter Vojtás: MFCS, Lecture Notes in Computer Science 2747. Springer, pp. 642–651. Available at http://dx.doi.org/10.1007/978-3-540-45138-9_58.
17. Wolfgang Thomas (1995): On the Synthesis of Strategies in Infinite Games. In: STACS, pp. 1–13. Available at http://dx.doi.org/10.1007/3-540-59042-0_57.
18. Yanjing Wang & Guillaume Aucher (2013): An Alternative Axiomatization of DEL and Its Applications. In: IJCAI. Available at http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6802.
19. Quan Yu, Ximing Wen & Yongmei Liu (2013): Multi-Agent Epistemic Explanatory Diagnosis via Reasoning about Actions. In: IJCAI, pp. 1183–1190. Available at http://ijcai.org/papers13/Papers/IJCAI13-178.pdf.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org