{"id":16311524,"url":"https://github.com/klausnat/sat-solver-dpll-cnf","last_synced_at":"2025-08-01T06:14:12.007Z","repository":{"id":185584886,"uuid":"423073576","full_name":"klausnat/SAT-solver-DPLL-CNF","owner":"klausnat","description":"DPLL satisfiability decision procedure for boolean formulas in conjunctive normal form, with a dependent type that guarantees its correctness","archived":false,"fork":false,"pushed_at":"2021-11-30T06:04:35.000Z","size":46,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-14T20:18:07.271Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Coq","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/klausnat.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":"2021-10-31T06:39:44.000Z","updated_at":"2024-03-17T13:34:49.000Z","dependencies_parsed_at":null,"dependency_job_id":"65c13c29-b159-44a6-9677-f75a009ee9eb","html_url":"https://github.com/klausnat/SAT-solver-DPLL-CNF","commit_stats":null,"previous_names":["klausnat/sat-solver-dpll-cnf"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klausnat%2FSAT-solver-DPLL-CNF","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klausnat%2FSAT-solver-DPLL-CNF/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klausnat%2FSAT-solver-DPLL-CNF/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klausnat%2FSAT-solver-DPLL-CNF/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/klausnat","download_url":"https://codeload.github.com/klausnat/SAT-solver-DPLL-CNF/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248952358,"owners_count":21188427,"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-10-10T21:44:41.105Z","updated_at":"2025-04-14T20:18:11.466Z","avatar_url":"https://github.com/klausnat.png","language":"Coq","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SAT-solver-DPLL-CNF\n\nThis code is the solution to one of exercises from the book: \"Certified Programming with Dependent Types\" by Adam Chlipala.\n\nPart II\nProgramming with Dependent Types\nChapter 6, Subset Types and Variations.\n\n0.4 From Subset, Exercise #3.\n\nImplement the DPLL satisfiability decision procedure for boolean formulas in conjunc-\ntive normal form, with a dependent type that guarantees its correctness. An example\nof a reasonable type for this function would be ∀ f : formula, {truth : tvals | formu-\nlaTrue truth f } + {∀ truth, ¬ formulaTrue truth f }. Implement at least the basic\nbacktracking algorithm as defined here:\n\nhttp://en.wikipedia.org/wiki/DPLL_algorithm\n\nIt might also be instructive to implement the unit propagation and pure literal elimi-\nnation optimizations described there or some other optimizations that have been used\nin modern SAT solvers.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fklausnat%2Fsat-solver-dpll-cnf","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fklausnat%2Fsat-solver-dpll-cnf","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fklausnat%2Fsat-solver-dpll-cnf/lists"}