On the Complexity of Dynamic Epistemic Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

On the Complexity of Dynamic Epistemic Logic

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

Dates and versions

hal-00856468 , version 1 (01-09-2013)

Identifiers

  • HAL Id : hal-00856468 , version 1

Cite

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⟩
369 View
115 Download

Share

Gmail Facebook X LinkedIn More