A classic backtracking algorithm for solving Boolean satisfiability puzzles.
DPLL is like doing a giant Sudoku with a bossy pencil. It tries a yes-or-no guess, then erases fast when the puzzle says “nope.”
It is used in SAT solvers and automated reasoning. It backtracks from conflicts to find true-or-false choices that fit.
CSP
DPLL is close to CSP. Both look for choices that obey all rules.
Resolution
DPLL uses backtracking search. Resolution uses logical proof.
Unification
DPLL and Unification are both basic tools in classic symbolic AI.