-
ZRes
- Referenced in 9 articles
[sw28380]
- ZRes: The old Davis-Putnam procedure meets ZBDD. ZRes is a propositional prover based ... original procedure of Davis and Putnam, as opposed to its modified version of Davis, Logeman...
-
MaxSolver
- Referenced in 20 articles
[sw01990]
- bound algorithm based on the Davis–Putnam–Logemann–Loveland procedure (DPLL...
-
DPvis
- Referenced in 7 articles
[sw00219]
- runs of the DPLL (Davis-Putnam-Logemann-Loveland) procedure. DPvis uses advanced graph layout algorithms...
-
EufDPLL
- Referenced in 1 article
[sw11551]
- generalisation of the Davis-Putnam-Loveland-Logemann procedure (EUF-DPLL). EufDPLL is a tool...
-
ManySAT
- Referenced in 32 articles
[sw00544]
- ManySAT: a parallel SAT solver. ManySAT, a new...
-
MiniSat
- Referenced in 531 articles
[sw00577]
- An extensible SAT-solver. MiniSat is a minimalistic...
-
CHIP
- Referenced in 79 articles
[sw03450]
- Solving a cutting-stock problem with the constraint...
-
Walksat
- Referenced in 207 articles
[sw04328]
- GSAT and WalkSat are local search algorithms to...
-
SATO
- Referenced in 195 articles
[sw04451]
- SATO: A Solver for Propositional Satisfiability: The Davis...
-
Chaff
- Referenced in 567 articles
[sw06916]
- Chaff:engineering an efficient SAT solver. Boolean Satisfiability...
-
BerkMin
- Referenced in 160 articles
[sw06917]
- BerkMin: A fast and robust SAT-solver. We...
-
NiVER
- Referenced in 18 articles
[sw06958]
- NiVER: Non-increasing variable elimination resolution for preprocessing...
-
NQTHM
- Referenced in 149 articles
[sw07543]
- A computational logic handbook. This book is a...
-
DIMACS
- Referenced in 515 articles
[sw08221]
- The DIMACS Implementation Challenges address questions of determining...
-
CBMC
- Referenced in 77 articles
[sw09719]
- CBMC is a Bounded Model Checker for ANSI...
-
Leibniz
- Referenced in 31 articles
[sw12871]
- The Leibniz System is a software package for...
-
RSat
- Referenced in 22 articles
[sw13117]
- RSat is a complete Boolean satisfiability solver with...