A modular sat/smt solver with proof output.
-
Updated
Jan 8, 2024 - OCaml
A modular sat/smt solver with proof output.
A simple k-SAT problem solver.
Propositional logic SAT solver using the DPLL method. Supported by a lexer, parser, and clause form converter.
SAT solver for Linear Dynamic Logic
A constraint solver built from scratch in OCaml
Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem
OCaml experimental sat3 solver
a logic game for constraint satisfaction problem using a SAT Solver
CDCL (Conflict-Driven Clause Learning) based SAT solver written in OCaml
An ocaml implementation of conflict-driven reasoning
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."