Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 55-76 |
Number of pages | 22 |
Journal | Journal of Logic and Computation |
Volume | 20 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2010 |