This project is my independent research into SAT solvers written entirely in Python, designed to explore the theory and practice of propositional satisfiability. It begins with a baseline DPLL ...
A fully functional set of OCaml modules to solve satisfiability problems represented in conjunctive normal form (CNF) using only the OCaml list library and the DPLL algorithm. The repository is broken ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results