A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Reasoning about knowledge
Combining deduction and model checking into Tableaux and algorithms for converse-PDL
Information and Computation
Modal logic
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Dynamic Epistemic Logic
Logics of communication and change
Information and Computation
Quantifying over coalitions in epistemic logic
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A Tableau Method for Public Announcement Logics
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Optimal regression for reasoning about knowledge and actions
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A verification framework for agent knowledge
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Terminating Tableaux for Dynamic Epistemic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
The Situation Calculus: A Case for Modal Logic
Journal of Logic, Language and Information
Description logics for relative terminologies
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Graded computation tree logic with binary coding
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
McCarthy variations in a modal key
Artificial Intelligence
Reasoning about protocol change and knowledge
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Generalized arrow update logic
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
An epistemic logic with hypotheses
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
Tableau Method and NEXPTIME-Completeness of DEL-Sequents
Electronic Notes in Theoretical Computer Science (ENTCS)
Succinctness of epistemic languages
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Beth definability in expressive description logics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
ACM Transactions on Computational Logic (TOCL)
A logic of revelation and concealment
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
On the relative succinctness of two extensions by definitions of multimodal logic
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Reasoning About Agent Types and the Hardest Logic Puzzle Ever
Minds and Machines
On the succinctness of some modal logics
Artificial Intelligence
Coalgebraic announcement logics
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Beth definability in expressive description logics
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and 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 public 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 succinct in PAL than in EL. This shows that, despite the known fact that PAL and EL have the same expressive power, there is a benefit in adding the public announcement operator to EL: it exponentially increases the succinctness of formulas without having negative effects on computational complexity.