Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic

DOI10.4204/eptcs.379.32arXiv2307.05067OpenAlexW4383618632MaRDI QIDQ6118728

Malvin Gattinger, Unnamed Author

Publication date: 28 February 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.05067

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Mathematical logic and foundations (03-XX)

Cites Work

• Dynamic epistemic logic
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Symbolic model checking: \(10^{20}\) states and beyond
• Zero-suppressed BDDs and their applications
• Binary Decision Diagrams
• Sum and Product in Dynamic Epistemic Logic
• Variable Forgetting in Reasoning about Knowledge
• Graph-Based Algorithms for Boolean Function Manipulation
• Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
• Symbolic model checking of public announcement protocols
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic