{"id":19429777,"url":"https://github.com/chayleaf/emilia","last_synced_at":"2026-05-12T23:02:01.926Z","repository":{"id":249184465,"uuid":"830602067","full_name":"chayleaf/emilia","owner":"chayleaf","description":"a very simple SAT solver","archived":false,"fork":false,"pushed_at":"2025-02-05T13:08:09.000Z","size":24,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-05T14:22:20.689Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"agpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/chayleaf.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"COPYING","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-07-18T15:30:35.000Z","updated_at":"2025-02-05T13:08:12.000Z","dependencies_parsed_at":"2025-01-07T20:12:13.864Z","dependency_job_id":"7c13fe4b-0c0a-45bb-98f0-10004900d576","html_url":"https://github.com/chayleaf/emilia","commit_stats":null,"previous_names":["chayleaf/emilia"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chayleaf%2Femilia","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chayleaf%2Femilia/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chayleaf%2Femilia/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chayleaf%2Femilia/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/chayleaf","download_url":"https://codeload.github.com/chayleaf/emilia/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240612540,"owners_count":19829027,"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":[],"created_at":"2024-11-10T14:21:21.545Z","updated_at":"2026-05-12T23:01:56.906Z","avatar_url":"https://github.com/chayleaf.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Emilia\n\nA very simple SAT solver. My goal is experimenting with creating a\ndeclarative module system, which requires finding an arrangement that\nsatisfies all of the modules' requirements (e.g. the ordering that the\nmodules requested is satisfied, there are no conflicting values, etc). I\nmay end up using something other than SAT for that purpose, so I suppose\nthis will be my area for theorem proving experimentation.\n\nRandom resources:\n\n- http://minisat.se/downloads/MiniSat.pdf\n- https://codingnest.com/modern-sat-solvers-fast-neat-and-underused-part-3-of-n/\n- https://www.cs.ubc.ca/labs/isd/Projects/monosat/smmt.pdf\n- http://web.archive.org/web/20231128190422/https://cse.unl.edu/~choueiry/S18-235H/files/SATslides07.pdf\n- https://cse.buffalo.edu/LRG/PDF/moonslides.pdf\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchayleaf%2Femilia","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fchayleaf%2Femilia","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fchayleaf%2Femilia/lists"}