A university scheduling problem solved by reduction to SAT and the use of a SAT solver (minisat).
-
Updated
May 19, 2015 - C++
A university scheduling problem solved by reduction to SAT and the use of a SAT solver (minisat).
A reference implementation of PDR for boolean transition systems
The SAT solver checks if the given CNF formula evaluates to true for some arbitrary input combinations.
OCaml bindings for the Glucose SAT solver (not really working, work in progress)
Parallel SAT Solver
Lightweight but fast SAT solver with input sorting and CDCL
A DPLL-based SAT solver focused on traceability
Boolean SAT solver based on DPLL algorithm with randomization and geometric restarts (RGR) heuristic
metaSMT-Based SMT-LIB2 Consistency Checker
A SAT-IP Hybrid MaxSAT solver
(Old college project) Creates and solves an arbitrarily shaped Rikudo Puzzle using a SAT-solver.
Boolean satisfiability problem (SAT), maximum satisfiability problem (MAX-SAT) etc
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."