Uncommon · History
DPLL algorithm
Algorithm for solving the CNF-SAT problem
In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem. It was introduced in 1961 by Martin Davis, George Logemann and Donald W. Loveland and is a refinement of the earlier Davis–Putnam algorithm, which is a resolution-based procedure developed by Davis and Hilary Putnam in 1960.
From Wikipedia
In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem. It was introduced in 1961 by Martin Davis, George Logemann and Donald W. Loveland and is a refinement of the earlier Davis–Putnam algorithm, which is a resolution-based procedure developed by Davis and Hilary Putnam in 1960. Especially in older publications, the Davis–Logemann–Loveland algorithm is often referred to as the "Davis–Putnam method" or the "DP algorithm". Other common names that maintain the distinction are DLL and DPLL.
Text: Wikipédia, CC BY-SA 4.0. · Image: No machine-readable author provided. Tizio assumed (based on... (Public domain) ·
Related cards
-
G★★
Gale–Shapley algorithm
Algorithm for solving the stable matching problem
-
L★★
Levenberg–Marquardt algorithm
Algorithm
-
S★★★
Shor's algorithm
Quantum algorithm for integer factorization
-
★
Floyd Cycle Detection Algorithm
Algorithm of cycle finding
-
L★★
Logic Theorist
Computer program
-
★
Ford–Fulkerson algorithm
Algorithm