Skip to Main content Skip to Navigation

Undecidability in Epistemic Planning

Guillaume Aucher 1 Thomas Bolander 2
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Dynamic epistemic logic (DEL) provides a very expressive framework for multi-agent planning that can deal with nondeterminism, partial observability, sensing actions, and arbitrary nesting of beliefs about other agents' beliefs. However, as we show in this paper, this expressiveness comes at a price. The planning framework is undecidable, even if we allow only purely epistemic actions (actions that change only beliefs, not ontic facts). Undecidability holds already in the S5 setting with at least 2 agents, and even with 1 agent in S4. It shows that multi-agent planning is robustly undecidable if we assume that agents can reason with an arbitrary nesting of beliefs about beliefs. We also prove a corollary showing undecidability of the DEL model checking problem with the star operator on actions (iteration).
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download
Contributor : Guillaume Aucher <>
Submitted on : Wednesday, May 22, 2013 - 11:26:21 AM
Last modification on : Thursday, January 7, 2021 - 4:24:29 PM
Long-term archiving on: : Tuesday, April 4, 2017 - 9:21:20 AM


Files produced by the author(s)


  • HAL Id : hal-00824653, version 1


Guillaume Aucher, Thomas Bolander. Undecidability in Epistemic Planning. [Research Report] RR-8310, INRIA. 2013. ⟨hal-00824653⟩



Record views


Files downloads