Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/m4lvin/mchlpe
🕵️🤥 A Model Checker for the Hardest Logic Puzzle Ever
https://github.com/m4lvin/mchlpe
agent-types epistemic-logic haskell model-checking puzzle
Last synced: 4 months ago
JSON representation
🕵️🤥 A Model Checker for the Hardest Logic Puzzle Ever
- Host: GitHub
- URL: https://github.com/m4lvin/mchlpe
- Owner: m4lvin
- Created: 2016-04-28T13:27:58.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2023-10-09T10:10:29.000Z (over 1 year ago)
- Last Synced: 2023-10-09T11:28:55.883Z (over 1 year ago)
- Topics: agent-types, epistemic-logic, haskell, model-checking, puzzle
- Language: Haskell
- Homepage:
- Size: 370 KB
- Stars: 4
- Watchers: 2
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# A Model Checker for the Hardest Logic Puzzle Ever
## Abstract
We implement the logics of Agent Types from [LiuWang2013] in Haskell.
The resulting program checks various Theorems in fractions of seconds.
In particular we verify a solution [Rabern2008] to the so-called
Hardest Logic Puzzle Ever.
The implementation is stand-alone, while similar to DEMO-S5 [vEijck2007].
We make heavy use of Haskell's pattern matching and models are
represented explicitly, using a custom data type based on lists.
Complete literate Haskell documentation is in [mchlpe.pdf](mchlpe.pdf).
Slides from a talk at [PhDs in Logic VIII](https://www2.mathematik.tu-darmstadt.de/~logik/phdsinlogic2016/)
are [here](https://w4eg.de/malvin/illc/2016-05-10-mchlpe-talk-darmstadt.pdf).
## References
[LiuWang2013] Fenrong Liu and Yanjing Wang:
*Reasoning About Agent Types and the Hardest Logic Puzzle Ever*.
In: *Minds and Machines* Vol. 23, 2013.
[doi:10.1007/s11023-012-9287-x](https://doi.org/10.1007/s11023-012-9287-x)
[vEijck2007] Jan van Eijck: *DEMO-S5*.
Tehnical Report, 2014.
[Rabern2008] Brian Rabern and Landon Rabern:
*A Simple Solution to the Hardest Logic Puzzle Ever*.
In: *Analysis* Vol. 68, 2008.
[doi:10.1093/analys/68.2.105](https://doi.org/10.1093/analys/68.2.105)
## Obligatory XKCDs
[](https://xkcd.com/246/)
[](https://xkcd.com/1319/)