DPLL Algorithm

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
A recursive backtracking search procedure for propositional satisfiability that integrates variable splitting, unit propagation (boolean constraint propagation), pure literal elimination, and systematic backtracking to decide whether a CNF formula is satisfiable.