An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
-
Updated
Oct 28, 2021 - OCaml
An implementation of a recursive DPLL solver in OCaml. It parses setup (cnf ) DIMACS and checks if the formula is satisfied.
[alpha] An implementation of several classic transition systems that describe algorithms for SAT or SMT, for interactive exploration
Add a description, image, and links to the dpll-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dpll-algorithm topic, visit your repo's landing page and select "manage topics."