CDCL SAT solver

E822900

A CDCL SAT solver is an advanced algorithm for solving Boolean satisfiability problems that extends the classic DPLL approach with conflict-driven clause learning and non-chronological backtracking to greatly improve efficiency on large, complex instances.

Try in SPARQL Jump to: Statements Referenced by

Statements (57)

Predicate Object
instanceOf SAT solver
algorithm
abbreviation CDCL NERFINISHED
appliedIn AI reasoning
constraint solving
formal methods
hardware verification
model checking
planning
software verification
basedOn Davis–Putnam–Logemann–Loveland procedure NERFINISHED
designedFor industrial SAT instances
large SAT instances
exampleImplementation CryptoMiniSat NERFINISHED
Glucose NERFINISHED
Lingeling NERFINISHED
MapleSAT NERFINISHED
MiniSAT NERFINISHED
extends DPLL algorithm NERFINISHED
fullName Conflict-Driven Clause Learning SAT solver
hasFeature backjumping
clause activity heuristics
clause database management
conflict-driven clause learning
decision levels
first UIP learning
implication graph analysis
learned clauses
non-chronological backtracking
restarts
unit propagation
variable activity heuristics
watched literals
hasProperty backtrackable
clause-learning-based
complete decision procedure for SAT
conflict-driven
incomplete for UNSAT core minimization
sound
terminating
improvesOn DPLL algorithm NERFINISHED
influenced modern SMT solving techniques
introducedInField propositional satisfiability
performs Boolean constraint propagation
backtracking search
systematic search
relatedTo SMT solver
solves Boolean satisfiability problem
typicalImplementationLanguage C
C++
uses VSIDS heuristic NERFINISHED
clause learning scheme
conflict analysis
decision heuristic
implication graph
phase saving
restart policy

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.