{"id":17130997,"url":"https://github.com/m4lvin/mchlpe","last_synced_at":"2025-04-13T07:33:16.252Z","repository":{"id":88549421,"uuid":"57303978","full_name":"m4lvin/mchlpe","owner":"m4lvin","description":"🕵️🤥 A Model Checker for the Hardest Logic Puzzle Ever","archived":false,"fork":false,"pushed_at":"2023-10-09T10:10:29.000Z","size":379,"stargazers_count":5,"open_issues_count":1,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-05T14:12:12.108Z","etag":null,"topics":["agent-types","epistemic-logic","haskell","model-checking","puzzle"],"latest_commit_sha":null,"homepage":"","language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/m4lvin.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2016-04-28T13:27:58.000Z","updated_at":"2024-10-14T15:55:52.000Z","dependencies_parsed_at":null,"dependency_job_id":"df1f5873-7a52-4c53-9fb7-3fa0f14332f0","html_url":"https://github.com/m4lvin/mchlpe","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/m4lvin%2Fmchlpe","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/m4lvin%2Fmchlpe/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/m4lvin%2Fmchlpe/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/m4lvin%2Fmchlpe/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/m4lvin","download_url":"https://codeload.github.com/m4lvin/mchlpe/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240045016,"owners_count":19739186,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["agent-types","epistemic-logic","haskell","model-checking","puzzle"],"created_at":"2024-10-14T19:13:45.243Z","updated_at":"2025-02-23T02:30:36.469Z","avatar_url":"https://github.com/m4lvin.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# A Model Checker for the Hardest Logic Puzzle Ever\n\n## Abstract\n\nWe implement the logics of Agent Types from [LiuWang2013] in Haskell.\nThe resulting program checks various Theorems in fractions of seconds.\nIn particular we verify a solution [Rabern2008] to the so-called\nHardest Logic Puzzle Ever.\n\nThe implementation is stand-alone, while similar to DEMO-S5 [vEijck2007].\nWe make heavy use of Haskell's pattern matching and models are\nrepresented explicitly, using a custom data type based on lists.\n\nComplete literate Haskell documentation is in [mchlpe.pdf](mchlpe.pdf).\n\nSlides from a talk at [PhDs in Logic VIII](https://www2.mathematik.tu-darmstadt.de/~logik/phdsinlogic2016/)\nare [here](https://w4eg.de/malvin/illc/2016-05-10-mchlpe-talk-darmstadt.pdf).\n\n\n## References\n\n[LiuWang2013] Fenrong Liu and Yanjing Wang:\n*Reasoning About Agent Types and the Hardest Logic Puzzle Ever*.\nIn: *Minds and Machines* Vol. 23, 2013.\n[doi:10.1007/s11023-012-9287-x](https://doi.org/10.1007/s11023-012-9287-x)\n\n[vEijck2007] Jan van Eijck: *DEMO-S5*.\nTehnical Report, 2014.\n\u003chttps://homepages.cwi.nl/~jve/software/demo_s5/\u003e\n\n[Rabern2008] Brian Rabern and Landon Rabern:\n*A Simple Solution to the Hardest Logic Puzzle Ever*.\nIn: *Analysis* Vol. 68, 2008.\n[doi:10.1093/analys/68.2.105](https://doi.org/10.1093/analys/68.2.105)\n\n\n## Obligatory XKCDs\n\n[![xkcd: Labyrinth Puzzle](https://imgs.xkcd.com/comics/labyrinth_puzzle.png)](https://xkcd.com/246/)\n\n[![xkcd: Automation](https://imgs.xkcd.com/comics/automation.png)](https://xkcd.com/1319/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fm4lvin%2Fmchlpe","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fm4lvin%2Fmchlpe","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fm4lvin%2Fmchlpe/lists"}