On the Complexity of Dynamic Epistemic Logic

Guillaume Aucher 1 François Schwarzentruber 2
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only know that for public announcement logic, a fragment of DEL, the satisfiability problem and the model-checking problem are respectively PSPACE-complete and in P. We contribute to fill this gap by proving that for the DEL language with event models, the model-checking problem is, surprisingly, PSPACE-complete. Also, we prove that the satisfiability problem is NEXPTIME-complete. In doing so, we provide a sound and complete tableau method deciding the satisfiability problem.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-00856468
Contributor : Guillaume Aucher <>
Submitted on : Sunday, September 1, 2013 - 1:13:02 AM
Last modification on : Friday, November 16, 2018 - 1:23:04 AM
Long-term archiving on : Thursday, April 6, 2017 - 11:20:48 AM

File

TARK2013.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00856468, version 1

Citation

Guillaume Aucher, François Schwarzentruber. On the Complexity of Dynamic Epistemic Logic. TARK - Theoretical Aspects of Rationality and Knowledge - 2013, Jan 2013, Chennai, India. ⟨hal-00856468⟩

Share

Metrics

Record views

550

Files downloads

169