On the Complexity of Dynamic Epistemic Logic (Extended Version)

Guillaume Aucher 1 François Schwarzentruber 1
1 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.
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00759544
Contributeur : Guillaume Aucher <>
Soumis le : vendredi 30 novembre 2012 - 22:23:27
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : vendredi 1 mars 2013 - 03:58:37

Fichier

RR-8164.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00759544, version 1

Citation

Guillaume Aucher, François Schwarzentruber. On the Complexity of Dynamic Epistemic Logic (Extended Version). [Research Report] RR-8164, INRIA. 2012. 〈hal-00759544〉

Partager

Métriques

Consultations de la notice

415

Téléchargements de fichiers

150