Complexity and Succinctness of Public Announcement Logic
| Autor: | Carsten Lutz |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2005 |
| Předmět: |
Logik der öffentlichen Verkündung
epistemische Logik Common knowledge (logic) Theoretical computer science Computational complexity theory Computer science Extension (predicate logic) public announcement logic epistemic logic Operator (computer programming) Succinctness Epistemic modal logic Common knowledge Dynamic epistemic logic ddc:004 Hardware_LOGICDESIGN |
| Zdroj: | AAMAS |
| Popis: | There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and belief induced by knowledge-changing actions. The most basic such extension is public announcement logic (PAL), which is obtained from EL by adding an operator for truthful publix announcements. In this paper, we consider the computational complexity of PAL and show that it coincides with that of EL. This holds in the single- and multi-agent case, and also in the presence of common knowledge operators. We also prove that there are properties that can be expressed exponentially more succint in PAL than in EL. This shows that, despite the known fact that PAL and EL have the same expressive power, ther eis a benefit in adding the public announcement operator to EL: it exponentially increases the succinctness of formulas without having negative effects on computational complexity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|