References

  1. Thomas Ågotnes & Natasha Alechina (2012): Epistemic coalition logic: completeness and complexity. In: International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes), pp. 1099–1106. Available at http://dl.acm.org/citation.cfm?id=2343854.
  2. Thomas Ågotnes, Philippe Balbiani, Hans van Ditmarsch & Pablo Seban (2010): Group announcement logic. Journal of Applied Logic 8(1), pp. 62–81, doi:10.1016/j.jal.2008.12.002.
  3. Thomas Ågotnes & Hans van Ditmarsch (2008): Coalitions and announcements. In: 7th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), Estoril, Portugal, May 12-16, 2008, Volume 2, pp. 673–680, doi:10.1145/1402298.1402318.
  4. Thomas Ågotnes & Hans van Ditmarsch (2014): Knowledge Games and Coalitional Abilities. In: Johan van Benthem on Logic and Information Dynamics. Springer, pp. 451–485, doi:10.1007/978-3-319-06025-5_16.
  5. Thomas Ågotnes, Hans van Ditmarsch & Timothy Stewart French (2016): The Undecidability of Quantified Announcements. Studia Logica 104(4), pp. 597–640, doi:10.1007/s11225-016-9657-0.
  6. Philippe Balbiani (2015): Putting right the wording and the proof of the Truth Lemma for APAL. Journal of Applied Non-Classical Logics 25(1), pp. 2–19, doi:10.1080/11663081.2015.1011489.
  7. Philippe Balbiani, Alexandru Baltag, Hans van Ditmarsch, Andreas Herzig, Tomohiro Hoshi & Tiago de Lima (2008): `Knowable' as `known after an announcement'. Review of Symbolic Logic 1(3), pp. 305–334, doi:10.1017/S1755020308080210.
  8. Philippe Balbiani, Alexandru Baltag, Hans P. van Ditmarsch, Andreas Herzig, Tomohiro Hoshi & Tiago De Lima (2007): What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), Brussels, Belgium, June 25-27, 2007, pp. 42–51, doi:10.1145/1324249.1324259.
  9. Philippe Balbiani & Hans van Ditmarsch (2015): A Simple Proof of the Completeness of APAL. Studies in Logic 8(1), pp. 65–78. Available at http://studiesinlogic.sysu.edu.cn:8080/ljxyj/EN/abstract/abstract211.shtml.
  10. 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, doi:10.3166/jancl.21.9-34.
  11. Hans van Ditmarsch (2012): Quantifying Notes. In: Logic, Language, Information and Computation - 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012.Proceedings, pp. 89–109, doi:10.1007/978-3-642-32621-9_8.
  12. Hans van Ditmarsch, Wiebe van der Hoek & Barteld Kooi (2008): Dynamic Epistemic Logic. Synthese Library 337. Springer, doi:10.1007/978-1-4020-5839-4.
  13. Robert Goldblatt (1982): Axiomatising the Logic of Computer Programming. Lecture Notes in Computer Science 130. Springer, doi:10.1007/BFb0022481.
  14. Marc Pauly (2002): A Modal Logic for Coalitional Power in Games. Journal of Logic and Computation 12(1), pp. 149–166, doi:10.1093/logcom/12.1.149.
  15. Jan Plaza (2007): Logics of public communications (reprint of 1989's paper). Synthese 158(2), pp. 165–179, doi:10.1007/s11229-007-9168-7.
  16. Bryan Renne, Joshua Sack & Audrey Yap (2009): Dynamic Epistemic Temporal Logic. In: Logic, Rationality, and Interaction, Second International Workshop, LORI 2009, Chongqing, China, October 8-11, 2009. Proceedings, pp. 263–277, doi:10.1007/978-3-642-04893-7_21.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org