{"id":16756336,"url":"https://github.com/mmz33/dpll-sat-solver","last_synced_at":"2025-03-16T06:42:53.174Z","repository":{"id":112322967,"uuid":"237621263","full_name":"mmz33/DPLL-SAT-Solver","owner":"mmz33","description":"Implementation of DPLL SAT solver algorithm","archived":false,"fork":false,"pushed_at":"2020-02-01T20:33:30.000Z","size":840,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-22T19:14:00.667Z","etag":null,"topics":["backtracking","dpll-algorithm","heuristics","sat-solver"],"latest_commit_sha":null,"homepage":"","language":"Python","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/mmz33.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-02-01T13:47:10.000Z","updated_at":"2024-04-26T23:56:05.000Z","dependencies_parsed_at":"2023-05-13T05:15:19.016Z","dependency_job_id":null,"html_url":"https://github.com/mmz33/DPLL-SAT-Solver","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/mmz33%2FDPLL-SAT-Solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmz33%2FDPLL-SAT-Solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmz33%2FDPLL-SAT-Solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mmz33%2FDPLL-SAT-Solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mmz33","download_url":"https://codeload.github.com/mmz33/DPLL-SAT-Solver/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243835937,"owners_count":20355611,"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":["backtracking","dpll-algorithm","heuristics","sat-solver"],"created_at":"2024-10-13T03:25:32.799Z","updated_at":"2025-03-16T06:42:53.151Z","avatar_url":"https://github.com/mmz33.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DPLL-SAT-Solver\n\nDavis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form.\n\n## Run\n\nInput files format follows [DIMACS](http://www.satcompetition.org/2004/format-solvers2004.html).\n\nTo run on the benchmarks folder do:\n`python3 sat_dpll.py --run_benchmarks`. The code takes around 6 seconds to solve 100 SAT problems.\n\nTo run with a seperate input file, just do:\n`python3 sat_dpll.py --input_file your_file`\n\n## References\n\n- https://en.wikipedia.org/wiki/DPLL_algorithm\n- https://ths.rwth-aachen.de/wp-content/uploads/sites/4/teaching/vorlesung_satchecking/ws14_15/02a_sat_handout.pdf\n- http://www.cril.univ-artois.fr/~coste/Articles/coste-etal-sat05.pdf\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmmz33%2Fdpll-sat-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmmz33%2Fdpll-sat-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmmz33%2Fdpll-sat-solver/lists"}