Solving Sum and Product Riddle via BDD-based Model Checking

Thumbnail
View/Open
Author(s)
Luo, X
Su, K
Sattar, A
Chen, Y
Griffith University Author(s)
Year published
2008
Metadata
Show full item record
Abstract
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.
Conference Title
Proceedings - 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2008
Publisher URI
DOI
Copyright Statement
© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Subject
Computational logic and formal languages
Publication URI
Collection