A Semantic Approach to Decidability in Epistemic Planning
Pages 2361 - 2363
Abstract
Dynamic Epistemic Logic (DEL) provides a very rich planning formalism that can handle nondeterminism, partial observability and arbitrary knowledge nesting. The general framework is notoriously undecidable. In this paper, we pursue a novel semantic approach to achieve decidability, by focussing on the logic for epistemic planning, rather then to limit the syntax of the accepted modal formulae. Specifically, we augment the logic S5n by introducing a new interaction axiom that we call knowledge alignment, in order to control the ability of agents to unboundedly reason on the knowledge of other agents. We show that the resulting epistemic planning problem is decidable. In doing so, we prove that this framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
References
[1]
Guillaume Aucher and Thomas Bolander. 2013. Undecidability in Epistemic Planning. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, Francesca Rossi (Ed.). IJCAI/AAAI, 27--33.
[2]
Thomas Bolander and Mikkel Birkegaard Andersen. 2011. Epistemic planning for single and multi-agent systems. J. Appl. Non Class. Logics 21, 1 (2011), 9--34.
[3]
Thomas Bolander, Tristan Charrier, Sophie Pinchinat, and François Schwarzentruber. 2020. DEL-based epistemic planning: Decidability and complexity. Artif. Intell. 287 (2020), 103304.
[4]
Thomas Bolander, Martin Holm Jensen, and François Schwarzentruber. 2015. Complexity Results in Epistemic Planning. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, Qiang Yang and Michael J. Wooldridge (Eds.). AAAI Press, 2791--2797.
[5]
Tristan Charrier, Bastien Maubert, and François Schwarzentruber. 2016. On the Impact of Modal Depth in Epistemic Planning. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, Subbarao Kambhampati (Ed.). IJCAI/AAAI Press, 1030--1036.
[6]
Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. 2004. Reasoning About Knowledge. MIT Press.
[7]
Andreas Herzig, Jérôme Lang, and Pierre Marquis. 2005. Action progression and revision in multiagent belief structures. In Sixth Workshop on Nonmonotonic Reasoning, Action, and Change (NRAC).
[8]
Marvin L Minsky. 1967. Computation: finite and infinite machines. Prentice-Hall, Inc.
[9]
Cédric Paternotte. 2011. Being realistic about common knowledge: a Lewisian approach. Synth. 183, 2 (2011), 249--276.
[10]
Tran Cao Son, Enrico Pontelli, Chitta Baral, and Gregory Gelfond. 2015. Exploring the KD45 Property of a Kripke Model After the Execution of an Action Sequence. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA, Blai Bonet and Sven Koenig (Eds.). AAAI Press, 1604--1610.
[11]
Alejandro Torreño, Eva Onaindia, Antonín Komenda, and Michal Stolba. 2018. Cooperative Multi-Agent Planning: A Survey. ACM Comput. Surv. 50, 6 (2018), 84:1--84:32.
[12]
Hans P. van Ditmarsch, Wiebe van der Hoek, and Barteld P. Kooi. 2007. Dynamic Epistemic Logic. Vol. 337. Springer Netherlands.
Index Terms
- A Semantic Approach to Decidability in Epistemic Planning
Recommendations
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and ProofsThe completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
The decidability of the intensional fragment of classical linear logic
Intensional classical linear logic (MELL) is proved decidable.Intensional interlinear logic (RLL) is proved decidable.We adapt Kripke's method used to prove decidability for some relevance logics.The semi-relevant RLL emerges as a logic superior to MELL ...
Schematic validity in dynamic epistemic logic: decidability
LORI'11: Proceedings of the Third international conference on Logic, rationality, and interactionUnlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. The classic example is Public Announcement Logic (PAL), an extension of epistemic logic based on the idea of information acquisition as elimination of ...
Comments
Information & Contributors
Information
Published In
May 2023
3131 pages
ISBN:9781450394321
- General Chairs:
- Noa Agmon,
- Bo An,
- Program Chairs:
- Alessandro Ricci,
- William Yeoh
Sponsors
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Published: 30 May 2023
Check for updates
Author Tags
Qualifiers
- Poster
Conference
AAMAS '23
Sponsor:
AAMAS '23: International Conference on Autonomous Agents and Multiagent Systems
May 29 - June 2, 2023
London, United Kingdom
Acceptance Rates
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 20Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in