George Wahl Logemann (31 January 1938, Milwaukee, – 5 June 2012, Hartford) was an American mathematician and computer scientist. He became well known for the Davis–Putnam–Logemann–Loveland algorithm to solve Boolean satisfiability problems. He also contributed to the field of computer music.
HINT:
In this Dossier
- ⭐ Core Definition: George Logemann
- George Logemann in the context of Davis–Putnam–Logemann–Loveland algorithm
George Logemann in the context of Davis–Putnam–Logemann–Loveland algorithm
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.
View the full Wikipedia page for Davis–Putnam–Logemann–Loveland algorithm