DPLL algorithm

E1997087 UNEXPLORED

The DPLL algorithm is a classic backtracking-based procedure for deciding the satisfiability of propositional logic formulas, forming the foundation of many modern SAT solvers.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (5)

Label Occurrences
DPLL algorithm canonical 2
DPLL 1
DPLL SAT-solving algorithm 1

Referenced by (6)

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

A Computing Procedure for Quantification Theory → influenced → Davis–Putnam–Logemann–Loveland algorithm ⓘ
linked to: DPLL algorithm
CDCL SAT solver → extends → DPLL algorithm ⓘ
CDCL SAT solver → basedOn → Davis–Putnam–Logemann–Loveland procedure ⓘ
linked to: DPLL algorithm
CDCL SAT solver → improvesOn → DPLL algorithm ⓘ
DPLL(T) → basedOn → DPLL ⓘ
linked to: DPLL algorithm
DPLL(T) → extends → DPLL SAT-solving algorithm ⓘ
linked to: DPLL algorithm