References

  1. T. Ågotnes, H. van Ditmarsch & T. French (2016): The Undecidability of Quantified Announcements. Studia Logica 104(4), pp. 597–640, doi:10.1007/s11225-016-9657-0.
  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. Carlos E. Alchourrón, Peter Gärdenfors & David Makinson (1985): On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. The Journal of Symbolic Logic 50, pp. 510–530, doi:10.2307/2274239.
  4. Natasha Alechina, Hans van Ditmarsch, Rustam Galimullin & Tuo Wang (2021): Verification and Strategy Synthesis for Coalition Announcement Logic. Journal of Logic, Language and Information 30(4), pp. 671–700, doi:10.1007/s10849-021-09339-6.
  5. Philippe Balbiani, Alexandru Baltag, Hans van Ditmarsch, Andreas Herzig, Tomohiro Hoshi & Tiago de Lima (2008): `Knowable' as `Known after an Announcement'. The Review of Symbolic Logic 1(3), pp. 305–334, doi:10.1017/S1755020308080210.
  6. Philippe Balbiani, Hans van Ditmarsch & Andrey Kudinov (2013): Subset Space Logic with Arbitrary Announcements. In: Proceedings of ICLA 2013, pp. 233–244, doi:10.1007/978-3-642-36039-8_21.
  7. Alexandru Baltag, Lawrence S. Moss & SLawomir Solecki (1998): The Logic of Public Announcements, Common Knowledge, and Private Suspicions. In: I. Gilboa: Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 98), pp. 43–56, doi:10.5555/645876.671885.
  8. Alexandru Baltag, Aybüke Özgün & Ana Lucia Vargas Sandoval (2023): Arbitrary Public Announcement Logic with Memory. Journal of Philosophical Logic 52(1), pp. 53–110, doi:10.1007/s10992-022-09664-6.
  9. Alexandru Baltag, Aybüke Özgün & Ana Lucia Vargas Sandoval (2017): Topo-Logic as a Dynamic-Epistemic Logic. In: Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada: Logic, Rationality, and Interaction. Springer Berlin Heidelberg, pp. 330–346, doi:10.1007/978-3-662-55665-8_23.
  10. Hans van Ditmarsch & Tim French (2022): Quantifying over Boolean announcements. Logical Methods in Computer Science 18(1), doi:10.46298/lmcs-18(1:20)2022.
  11. Hans van Ditmarsch, Tim French & Sophie Pinchinat (2010): Future Event Logic – Axioms and Complexity. In: Lev D. Beklemishev, Valentin Goranko & Valentin B. Shehtman: Advances in Modal Logic 8, papers from the eighth conference on "Advances in Modal Logic," held in Moscow, Russia, 24-27 August 2010. College Publications, pp. 77–99.
  12. Hans van Ditmarsch, Andreas Herzig, Jérôme Lang & Pierre Marquis (2009): Introspective Forgetting. Synthese 169(2), pp. 405–423, doi:10.1007/s11229-009-9554-4.
  13. Hans van Ditmarsch, Wiebe van der Hoek & Barteld Kooi (2008): Dynamic Epistemic Logic. Synthese Library 337. Springer Netherlands, doi:10.1007/978-1-4020-5839-4.
  14. Huimin Dong, Xu Li & Yì N. Wáng (2021): Weighted Modal Logic in Epistemic and Deontic Contexts. In: Sujata Ghosh & Thomas Icard: Proceedings of the Eighth International Conference on Logic, Rationality and Interaction (LORI 2021), Lecture Notes of Theoretical Computer Science 13039. Springer, pp. 73–87, doi:10.1007/978-3-030-88708-7_6.
  15. Ronald Fagin & Joseph Y. Halpern (1988): Belief, Awareness, and Limited Reasoning. Artificial Intelligence 34(1), pp. 39–76, doi:10.1016/0004-3702(87)90003-8.
  16. Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi (1995): Reasoning about Knowledge. The MIT Press, doi:10.7551/mitpress/5803.001.0001.
  17. Aviezri S Fraenkel, Edward R Scheinerman & Daniel Ullman (1993): Undirected Edge Geography. Theoretical Computer Science 112(2), pp. 371–381, doi:10.1016/0304-3975(93)90026-P.
  18. Tim French & Hans van Ditmarsch (2008): Undecidability for Arbitrary Public Announcement Logic. In: Carlos Areces & Robert Goldblatt: Advances in Modal Logic 7. College Publications, pp. 23–42.
  19. Rustam Galimullin, Natasha Alechina & Hans van Ditmarsch (2018): Model Checking for Coalition Announcement Logic. In: Frank Trollmann & Anni-Yasmin Turhan: KI 2018: Advances in Artificial Intelligence. Springer International Publishing, Cham, pp. 11–23, doi:10.1007/978-3-030-00111-7_2.
  20. Mikkel Hansen, Kim Guldstrand Larsen, Radu Mardare & Mathias Ruggaard Pedersen (2018): Reasoning about Bounds in Weighted Transition Systems. Logical Methods in Computer Science 14(4), pp. 1–32, doi:10.23638/LMCS-14(4:19)2018.
  21. Jaakko Hintikka (1962): Knowledge and Belief: An Introduction to the Logic of Two Notions. Cornell University Press, Ithaca, New York.
  22. Jôme Lang, Paolo Liberatore & Pierre Marquis (2003): Propositional Independence: Formula-Variable Independence and Forgetting. Journal of Artificial Intelligence Research 18(1), pp. 391–443, doi:10.5555/1622420.1622431.
  23. Kim G. Larsen & Radu Mardare (2014): Complete Proof Systems for Weighted Modal Logic. Theoretical Computer Science 546(12), pp. 164–175, doi:10.1016/j.tcs.2014.03.007.
  24. Xiaolong Liang & Yì N. Wáng (2022): Epistemic Logic over Weighted Graphs. In: Proceedings of the Second International Workshop on Logics for New-Generation AI. College Publications, pp. 43–58.
  25. David Lichtenstein & Michael Sipser (1980): GO Is Polynomial-Space Hard. Journal of the ACM 27(2), pp. 393–401, doi:10.1145/322186.322201.
  26. Fangzhen Lin & Ray Reiter (1994): Forget It!. In: Working Notes of AAAI Fall Symposium on Relevance, pp. 154–159.
  27. John-Jules Ch. Meyer & Wiebe van der Hoek (1995): Epistemic Logic for AI and Computer Science. Cambridge University Press, doi:10.1017/CBO9780511569852.
  28. Pavel Naumov & Jia Tao (2015): Logic of Confidence. Synthese 192, pp. 1821–1838, doi:10.1007/s11229-014-0655-3.
  29. Marc Pauly (2002): A Modal Logic for Coalition Power in Games. Journal of Logic Computation 12(1), pp. 149–166, doi:10.1093/logcom/12.1.149.
  30. Jan A. Plaza (1989): Logics of Public Communications. In: M. L. Emrich, M. S. Pfeifer, M. Hadzikadic & Z. W. Ras: Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems (ISMIS '89). Oak Ridge National Laboratory, pp. 201–216.
  31. W. V. Quine (1956): Quantifiers and Propositional Attitudes. The Journal of Philosophy 53(5), pp. 177–187, doi:10.2307/2022451.
  32. Thomas J. Schaefer (1978): On the Complexity of Some Two-Person Perfect-Information Games. Journal of Computer and System Sciences 16(2), pp. 185–225, doi:10.1016/0022-0000(78)90045-4.
  33. Yì N. Wáng & Thomas Ågotnes (2013): Subset Space Public Announcement Logic. In: Kamal Lodaya: Proceedings of ICLA, Lecture Notes in Computer Science 7750. Springer, pp. 245–257, doi:10.1007/978-3-642-36039-8_22.
  34. Georg H. von Wright (1951): An Essay in Modal Logic. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company.
  35. Kang Xu & Yì N. Wáng (2018): Group Simple Announcement Logic. Studies in Logic 11(1), pp. 1–22.
  36. Yan Zhang & Yi Zhou (2009): Knowledge forgetting: Properties and applications. Artificial Intelligence 173(16), pp. 1525–1537, doi:10.1016/j.artint.2009.07.005.

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