Propositional logic SAT solver using the DPLL method. Supported by a lexer, parser, and clause form converter.
-
Updated
May 23, 2023 - OCaml
Propositional logic SAT solver using the DPLL method. Supported by a lexer, parser, and clause form converter.
Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem
CDCL (Conflict-Driven Clause Learning) based SAT solver written in OCaml
An ocaml implementation of conflict-driven reasoning
OCaml experimental sat3 solver
A simple k-SAT problem solver.
SAT solver for Linear Dynamic Logic
a logic game for constraint satisfaction problem using a SAT Solver
A constraint solver built from scratch in OCaml
A modular sat/smt solver with proof output.
Add a description, image, and links to the sat-solver topic page so that developers can more easily learn about it.
To associate your repository with the sat-solver topic, visit your repo's landing page and select "manage topics."