Tableaux for public announcement logics - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Computation Année : 2010

Tableaux for public announcement logics

Résumé

Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In this article we propose a labelled tableau calculus for this logic, and show that it decides satisfiability of formulas in deterministic polynomial space. Since this problem is known to be PSPACE-complete, it follows that our proof method is optimal.

Dates et versions

hal-03470301 , version 1 (08-12-2021)

Identifiants

Citer

Philippe Balbiani, Hans van Ditmarsch, Andreas Herzig, Tiago De Lima. Tableaux for public announcement logics. Journal of Logic and Computation, 2010, Special Issue on Tableaux and Analytic Proof Methods, 20 (1), pp.55--76. ⟨10.1093/logcom/exn060⟩. ⟨hal-03470301⟩
29 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More