Solving Sum and Product Riddle via BDD-Based Model Checking

We model the sum and product riddle in public announcement logic, which is interpreted on an epistemic Kripke model. The model is symbolically represented as a finite state program with n agents. A model checking method to the riddle is developed by using the BDD-based symbolic model checking algorithm for logic of knowledge we developed in [7]. The method is implemented by extending the model checker MCTK [7] and then the solution of the riddle is verified successfully.

[1]  Rineke Verbrugge,et al.  Model Checking Sum and Product , 2005, Australian Conference on Artificial Intelligence.

[2]  Jan van Eijck,et al.  Dynamic epistemic modelling , 2004 .

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

[4]  Ron van der Meyden,et al.  MCK: Model Checking the Logic of Knowledge , 2004, CAV.

[5]  Alessio Lomuscio,et al.  MCMAS: A Model Checker for Multi-agent Systems , 2006, TACAS.

[6]  Abdul Sattar,et al.  Verification of Multi-agent Systems Via Bounded Model Checking , 2006, Australian Conference on Artificial Intelligence.

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

[8]  Rineke Verbrugge,et al.  Sum and Product in Dynamic Epistemic Logic , 2008, J. Log. Comput..