Symbolic model checking for Dynamic Epistemic Logic - S5 and beyond

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.

[1]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[2]  Wiebe van der Hoek,et al.  Model Checking Russian Cards , 2006, Electron. Notes Theor. Comput. Sci..

[3]  Jan van Eijck,et al.  Epistemic Verification of Anonymity , 2007, VODCA@FOSAD.

[4]  Jan van Eijck,et al.  Logics of communication and change , 2006, Inf. Comput..

[5]  Jan van Eijck,et al.  DEMO — A Demo of Epistemic Modelling , 2007 .

[6]  Jan van Eijck,et al.  Symbolic Model Checking for Dynamic Epistemic Logic , 2015, LORI.

[7]  Kaile Su,et al.  CacBDD: A BDD Package with Dynamic Cache Management , 2013, CAV.

[8]  Bernhard Nebel,et al.  Cooperative Epistemic Multi-Agent Planning for Implicit Coordination , 2017, M4M@ICLA.

[9]  Hans van Ditmarsch,et al.  The Russian Cards Problem , 2003, Stud Logica.

[10]  Johan van Benthem,et al.  Merging Frameworks for Interaction , 2009, J. Philos. Log..

[11]  Wiebe van der Hoek,et al.  Connecting dynamic epistemic and temporal epistemic logics , 2013, Log. J. IGPL.

[12]  Valentin Goranko,et al.  Secure aggregation of distributed information , 2014, arXiv.org.

[13]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[14]  Stephan Merz,et al.  Model Checking , 2000 .

[15]  Fabio Somenzi,et al.  CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .

[16]  François Schwarzentruber,et al.  On the Complexity of Dynamic Epistemic Logic , 2013, TARK.

[17]  Abdul Sattar,et al.  Solving Sum and Product Riddle via BDD-Based Model Checking , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[18]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[19]  Jan van Eijck,et al.  Action emulation , 2012, Synthese.

[20]  Jan van Eijck,et al.  Dynamic Epistemic Logics , 2014, Johan van Benthem on Logic and Information Dynamics.

[21]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[22]  W. Hoek,et al.  Dynamic Epistemic Logic , 2007 .

[23]  Alessio Lomuscio,et al.  MCMAS: an open-source model checker for the verification of multi-agent systems , 2017, International Journal on Software Tools for Technology Transfer.

[24]  Kaile Su,et al.  Symbolic model checking the knowledge of the dining cryptographers , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

[25]  Mark Ryan,et al.  Implementation of Belief Change Operators Using BDDs , 2002, Stud Logica.

[26]  Mark Ryan,et al.  Knowledge in multiagent systems: initial configurations and broadcast , 1999, TOCL.

[27]  Fernando Soler-Toscano,et al.  A geometric protocol for cryptography with cards , 2013, Des. Codes Cryptogr..

[28]  J. C. Burkill,et al.  A mathematician's miscellany , 1954 .

[29]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[30]  Nina Gierasimczuk,et al.  A note on a generalization of the Muddy Children puzzle , 2011, TARK XIII.

[31]  Abdul Sattar,et al.  Model Checking Temporal Logics of Knowledge Via OBDDs , 2007, Comput. J..

[32]  François Schwarzentruber,et al.  Arbitrary Public Announcement Logic with Mental Programs , 2015, AAMAS.

[33]  David Thomas,et al.  The Art in Computer Programming , 2001 .