Undecidability in Epistemic Planning - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2013

Undecidability in Epistemic Planning

(1) , (2)
1
2

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).
Fichier principal
Vignette du fichier
RR-8310.pdf (706.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00824653 , version 1 (22-05-2013)

Identifiers

  • HAL Id : hal-00824653 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More