A tiny implementation of logical resolution.
-
Updated
Apr 7, 2017 - OCaml
A tiny implementation of logical resolution.
A SAT solver for propositional clauses in cnf form
Add a description, image, and links to the satisfiability-solver topic page so that developers can more easily learn about it.
To associate your repository with the satisfiability-solver topic, visit your repo's landing page and select "manage topics."