The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
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
Dynamic Epistemic Logic
Tableaux for Public Announcement Logic
Journal of Logic and Computation
Terminating Tableaux for Dynamic Epistemic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
LoTREC: logical tableaux research engineering companion
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Information Processing Letters
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
Dynamic Epistemic Logic (DEL) deals with the representation of situations in a multi-agent and dynamic setting. It can express in a uniform way statements about:(i)what is true about an initial situation (ii)what is true about an event occurring in this situation (iii)what is true about the resulting situation after the event has occurred. After proving that what we can infer about (ii) given (i) and (iii) and what we can infer about (i) given (ii) and (iii) are both reducible to what we can infer about (iii) given (i) and (ii), we provide a tableau method deciding whether such an inference is valid. We implement it in LOTRECscheme and show that this decision problem is NEXPTIME-complete. This contributes to the proof theory and the study of the computational complexity of DEL which have rather been neglected so far.