Symbolic model checking for dynamic epistemic logic — S5 and beyond
Journal of Logic and Computation , Volume 28 - Issue 2 p. 367- 402
Dynamic Epistemic Logic (DEL) can model complex information scenarios in a way that appeals to logicians. However, existing DEL implementations are ad-hoc, so we do not know how the framework really performs. For this purpose, we want to hook up with the best available model checking and SAT techniques in computational logic. We do this by first providing a bridge: a new faithful representation of DEL models as so-called knowledge structures that allow for symbolic model checking. For more complex epistemic change we introduce knowledge transformers analogous to action models. Next, we show that we can now solve well-known benchmark problems in epistemic scenarios much faster than with existing methods for DEL. We also compare our approach to model checking for temporal logics. Finally, we show that our method is not just a matter of implementation, but that it raises significant issues about logical representation and update.
|Binary decision diagrams, Dynamic Epistemic Logic, Knowledge representation, Muddy Children, Russian Cards, Symbolic model checking|
|Journal of Logic and Computation|
|Logic, Rationality and Interaction|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
van Benthem, J. F. A. K, van Eijck, D.J.N, Gattinger, M, & Su, K. (2015). Symbolic model checking for dynamic epistemic logic — S5 and beyond. In Logic, Rationality & Interaction, LORI-5 (Vol. 28, pp. 367–402). doi:10.1093/logcom/exx038