Davis–Putnam–Logemann–Loveland (DPLL) is an algorithm introduced by Martin Davis, George Logemann and Donald W. Loveland in 1962. It was sometimes referred as the "Davis–Putnam method" or the "DP algorithm".
DPLL or Davis–Putnam–Logemann–Loveland is an Algorithm introduced by Martin Davis, George Logemann and Donald W. Loveland in 1962 to solve Boolean satisfiability problems (CNF-SAT).
References: