Statements (37)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:Boolean_satisfiability_problem |
| gptkbp:application |
combinatorial optimization
formal verification model checking theorem proving software verification hardware verification AI planning |
| gptkbp:category |
automated reasoning
logic in computer science constraint satisfaction |
| gptkbp:developedBy |
gptkb:DPLL_algorithm
|
| gptkbp:features |
restart strategies
backjumps to earlier decision levels dynamic variable ordering efficient clause database management learns new clauses from conflicts |
| gptkbp:fullName |
Conflict-Driven Clause Learning SAT solvers
|
| gptkbp:introducedIn |
late 1990s
|
| gptkbp:notableFor |
gptkb:CryptoMiniSat
gptkb:Lingeling gptkb:MiniSAT Glucose |
| gptkbp:relatedTo |
gptkb:logic
gptkb:DPLL_algorithm gptkb:SAT_problem |
| gptkbp:solvedBy |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:uses |
unit propagation
restarts conflict-driven clause learning decision heuristics non-chronological backtracking watched literals |
| gptkbp:bfsParent |
gptkb:3-SAT
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
CDCL SAT solvers
|