Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:category |
satisfiability algorithms
|
| gptkbp:complexity |
NP-complete (for SAT)
|
| gptkbp:extendsTo |
gptkb:Davis–Putnam_algorithm
|
| gptkbp:field |
gptkb:logic
computer science |
| gptkbp:format |
conjunctive normal form (CNF)
|
| gptkbp:fullName |
gptkb:Davis–Putnam–Logemann–Loveland_algorithm
|
| https://www.w3.org/2000/01/rdf-schema#label |
DPLL
|
| gptkbp:influenced |
modern SAT solvers
|
| gptkbp:introducedIn |
1962
|
| gptkbp:namedAfter |
gptkb:Hilary_Putnam
gptkb:Martin_Davis gptkb:Donald_Loveland gptkb:George_Logemann |
| gptkbp:relatedTo |
gptkb:logic
gptkb:CDCL_(Conflict-Driven_Clause_Learning) automated theorem proving |
| gptkbp:step |
backtracking
pure literal elimination unit clause propagation variable assignment |
| gptkbp:technique |
backtracking
pure literal elimination unit propagation |
| gptkbp:usedFor |
solving the Boolean satisfiability problem (SAT)
|
| gptkbp:bfsParent |
gptkb:Davis–Putnam–Logemann–Loveland_algorithm
|
| gptkbp:bfsLayer |
6
|