The logic of public announcements, common knowledge, and private suspicions
The logic of public announcements, common knowledge, and private suspicions
Complexity and succinctness of public announcement logic
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Logics of communication and change
Information and Computation
Tableaux for Public Announcement Logic
Journal of Logic and Computation
A Hybrid Public Announcement Logic with Distributed Knowledge
Electronic Notes in Theoretical Computer Science (ENTCS)
Tableau Method and NEXPTIME-Completeness of DEL-Sequents
Electronic Notes in Theoretical Computer Science (ENTCS)
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.01 |
Throughout the last decade, there has been an increased interest in various forms of dynamic epistemic logics to model the flow of information and the effect this flow has on knowledge in multi-agent systems. This enterprise, however, has mostly been applicationally and semantically driven. This results in a limited amount of proof theory for dynamic epistemic logics. In this paper, we try to compensate for a part of this by presenting terminating tableau systems for full dynamic epistemic logic with action models and for a hybrid public announcement logic (both without common knowledge). The tableau systems are extensions of already existing tableau systems, in addition to which we have used the reduction axioms of dynamic epistemic logic to define rules for the dynamic part of the logics. Termination is shown using methods introduced by Brauner, Bolander, and Blackburn.