Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Undecidability of Quantified Announcements (2405.15671v2)

Published 24 May 2024 in cs.LO

Abstract: This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic (APAL), group announcement logic (GAL), and coalition announcement logic (CAL). In APAL we consider the informative consequences of any announcement, in GAL we consider the informative consequences of a group of agents (this group may be a proper subset of the set of all agents) all of which are simultaneously (and publicly) making known announcements. So this is more restrictive than APAL. Finally, CAL is as GAL except that we now quantify over anything the agents not in that group may announce simultaneously as well. The logic CAL therefore has some features of game logic and of ATL. We show that when there are multiple agents in the language, the satisfiability problem is undecidable for APAL, GAL, and CAL. In the single agent case, the satisfiability problem is decidable for all three logics. This paper corrects an error to the submitted version of Undecidability of Quantified Announcements, identified by Yuta Asami . The nature of the error was in the definition of the formula $cga(X)$ (see Subsection 5.2) which is corrected in this version.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. T. Ågotnes. Action and knowledge in alternating-time temporal logic. Synthese (Special Section on Knowledge, Rationality and Action), 149(2):377–409, 2006.
  2. Group announcement logic. Journal of Applied Logic, 8:62–81, 2010.
  3. T. Ågotnes and H. van Ditmarsch. Coalitions and announcements. In Proc. of 7th AAMAS, pages 673–680. IFAAMAS, 2008.
  4. The undecidability of group announcements. In Proc. of the 13th AAMAS, pages 893–900, 2014.
  5. Alternating-time temporal logic. Journal of the ACM, 49:672–713, 2002.
  6. ‘Knowable’ as ‘known after an announcement’. Review of Symbolic Logic, 1(3):305–334, 2008.
  7. The logic of public announcements, common knowledge, and private suspicions. In Proc. of 7th TARK, pages 43–56. Morgan Kaufmann, 1998.
  8. F. Belardinelli and W. van der Hoek. Epistemic quantified boolean logic: Expressiveness and completeness results. In Q. Yang and M. Wooldridge, editors, Proceedings of 24th IJCAI, pages 2748–2754. AAAI Press, 2015.
  9. R. Berger. The undecidability of the domino problem. Number 66 in Memoirs of the American Mathematical Society. American Mathematical Soc., 1966.
  10. T. Bolander and M. Andersen. Epistemic planning for single and multi-agent systems. Journal of Applied Non-classical Logics, 21(1):9–34, 2011.
  11. Complexity results in epistemic planning. In Q. Yang and M. Wooldridge, editors, Proceedings of 24th IJCAI, pages 2791–2797. AAAI Press, 2015.
  12. Refinement modal logic. Information and Computation, 239:303–339, 2014.
  13. T. Charrier and F. Schwarzentruber. Arbitrary public announcement logic with mental programs. In G. Weiss, P. Yolum, R. Bordini, and E. Elkind, editors, Proceedings of AAMAS, pages 1471–1479. ACM, 2015.
  14. A colouring protocol for the generalized russian cards problem. Theor. Comput. Sci., 495:81–95, 2013.
  15. Reasoning about Knowledge. MIT Press, Cambridge MA, 1995.
  16. M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194–211, 1979.
  17. T. French and H. van Ditmarsch. Undecidability for arbitrary public announcement logic. In C. Areces and R. Goldblatt, editors, Advances in Modal Logic 7, pages 23–42, London, 2008. College Publications.
  18. J. Gerbrandy. Bisimulations on Planet Kripke. PhD thesis, University of Amsterdam, 1999. ILLC Dissertation Series DS-1999-01.
  19. J. Hales. Arbitrary action model logic and action model synthesis. In Proc. of 28th LICS, pages 253–262. IEEE, 2013.
  20. D. Harel. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. J. ACM, 33(1):224–248, 1986.
  21. C. Lutz. Complexity and succinctness of public announcement logic. In Proc. of the 5th AAMAS, pages 137–144, 2006.
  22. J. Miller and L. Moss. The undecidability of iterated modal relativization. Studia Logica, 79(3):373–407, 2005.
  23. M. Pauly. A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1):149–166, 2002.
  24. J. Plaza. Logics of public communications. In Proc. of the 4th ISMIS, pages 201–216. Oak Ridge National Laboratory, 1989.
  25. J. van Benthem. Correspondence theory. Springer, 1984.
  26. J. van Benthem. Logics for information update. In J. van Benthem, editor, Proc. of TARK VIII, pages 51–88, Los Altos, 2001. Morgan Kaufmann.
  27. J. van Benthem. One is a lonely number: on the logic of communication. In Logic colloquium 2002. Lecture Notes in Logic, Vol. 27, pages 96–129. A.K. Peters, 2006.
  28. J. van Benthem. Logic in Games. MIT Press, 2014.
  29. W. van der Hoek and M. Wooldridge. Tractable multiagent planning for epistemic goals. In Proc. of the First International Joint Conference on Autonomous Agents & Multiagent Systems (AAMAS 2002), pages 1167–1174. ACM, 2002.
  30. H. van Ditmarsch. Quantifying notes. In Proc. of 19th WoLLIC, LNCS 7456, pages 89–109. Springer, 2012.
  31. Future event logic - axioms and complexity. In L. Beklemishev, V. Goranko, and V. Shehtman, editors, Advances in Modal Logic 8, pages 77–99. College Publications, 2010.
  32. Dynamic Epistemic Logic, volume 337 of Synthese Library. Springer, 2007.
  33. The undecidability of quantified announcements. Studia Logica, 104(4) pages 597–640, 2016.
  34. Y. Asami A Note on the Undecidability of Quantified Announcements. Communicated, 2019.
Citations (24)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets