Abstract
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. Next, we show that we can now solve well-known benchmark problems in epistemic scenarios much faster than with existing DEL methods. Finally, we show that our method is not just a matter of implementation, but that it raises significant issues about logical representation and update.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. In: Bilboa, I. (ed.) TARK 1998, pp. 43–56 (1998)
van Benthem, J., van Eijck, J., Kooi, B.: Logics of communication and change. Information and Computation 204(11), 1620–1662 (2006)
van Benthem, J., Gerbrandy, J., Hoshi, T., Pacuit, E.: Merging frameworks for interaction. Journal of Philosophical Logic 38(5), 491–526 (2009)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. In: Cambridge Tracts in Theoretical Computer Science, no. 53. CUP, Cambridge (2001)
Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transaction on Computers C-35(8), 677–691 (1986)
Charrier, T., Schwarzentruber, F.: Arbitrary public announcement logic with mental programs. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pp. 1471–1479. IFAAMAS (2015)
Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1(1), 65–75 (1988)
Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Transactions on Programming Languages and Systems 16(5), 1512–1542 (1994)
Cordón-Franco, A., van Ditmarsch, H., Fernández-Duque, D., Soler-Toscano, F.: A geometric protocol for cryptography with cards. Designs, Codes and Cryptography 74(1), 113–125 (2015), http://dx.doi.org/10.1007/s10623-013-9855-y
van Ditmarsch, H.: The russian cards problem. Studia Logica 75(1), 31–62 (2003)
van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic epistemic logic, vol. 1. Springer, Heidelberg (2007)
van Ditmarsch, H., van der Hoek, W., van der Meyden, R., Ruan, J.: Model Checking Russian Cards. Electr. Notes Theor. Comput. Sci. 149(2), 105–123 (2006)
van Ditmarsch, H., van der Hoek, W., Ruan, J.: Connecting dynamic epistemic and temporal epistemic logics. Logic Journal of IGPL 21(3), 380–403 (2013)
Duque, D.F., Goranko, V.: Secure aggregation of distributed information. CoRR abs/1407.7582 (2014), http://arxiv.org/abs/1407.7582
van Eijck, J.: DEMO-S5. Tech. rep., CWI (2014)
van Eijck, J., Ruan, J., Sadzik, T.: Action emulation. Synthese 185(1), 131–151 (2012)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about knowledge, vol. 4. MIT Press, Cambridge (1995)
Gammie, P.: hBDD. https://github.com/peteg/hBDD (2011, updated 2014)
Gattinger, M.: HasCacBDD (2015), https://github.com/m4lvin/HasCacBDD
Gierasimczuk, N., Szymanik, J.: A note on a generalization of the Muddy Children puzzle. In: Apt, K.R. (ed.) TARK 2011, pp. 257–264. ACM (2011)
Gorogiannis, N., Ryan, M.D.: Implementation of Belief Change Operators Using BDDs. Studia Logica 70(1), 131–156 (2002)
Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms, Part 1, vol. 4A. Addison-Wesley Professional (2011)
Littlewood, J.: A Mathematician’s Miscellany. Methuen, London (1953)
Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: an open-source model checker for the verification of multi-agent systems. International Journal on Software Tools for Technology Transfer, 1–22 (2015)
Lomuscio, A.R., van der Meyden, R., Ryan, M.: Knowledge in Multiagent Systems: Initial Configurations and Broadcast. ACM Trans. Comp. L. 1(2), 247–284 (2000)
Luo, X., Su, K., Sattar, A., Chen, Y.: Solving Sum and Product Riddle via BDD-Based Model Checking. In: Web Intel./IAT Workshops, pp. 630–633. IEEE (2008)
Lv, G., Su, K., Xu, Y.: CacBDD: A BDD Package with Dynamic Cache Management. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 229–234. Springer, Heidelberg (2013)
van der Meyden, R., Su, K.: Symbolic Model Checking the Knowledge of the Dining Cryptographers. In: CSFW, pp. 280–291. IEEE Computer Society (2004)
Somenzi, F.: CUDD: CU Decision Diagram Package Release 2.5.0 (2012)
Su, K., Sattar, A., Luo, X.: Model Checking Temporal Logics of Knowledge Via OBDDs. The Computer Journal 50(4), 403–420 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Benthem, J., van Eijck, J., Gattinger, M., Su, K. (2015). Symbolic Model Checking for Dynamic Epistemic Logic. In: van der Hoek, W., Holliday, W., Wang, Wf. (eds) Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science(), vol 9394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48561-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-662-48561-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48560-6
Online ISBN: 978-3-662-48561-3
eBook Packages: Computer ScienceComputer Science (R0)