SAT-Solver based on conservative retractions
-
Updated
Feb 27, 2018 - Haskell
SAT-Solver based on conservative retractions
DPP and DPLL algorithms
SAT-Solver based on Polynomials
SAT solver assistant. Converts propositions (p ^ q) ==> CNF ==> DIMACS CNF files.
Código Haskell que reduz o problema de coloração em grafos para o problema de satisfabilidade booleana
SAT solver implemented in Haskell for course Knowledge Representation (2019) at the Vrije Universiteit.
Solving the N-Queens Problem Using a SAT Solver
Symbolic logic expressions
My first SMT solver (only QF_UF)
A SAT solver using the DPLL algorithm.
CNF Generator for Factoring Problems
My sandbox for experimenting with solver algorithms.
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."