Davis–Putnam algorithm

E238240 UNEXPLORED

The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.

Aliases (2)

Davis–Putnam–Logemann–Loveland algorithm ×1
Davis–Putnam–Logemann–Loveland procedure ×1

Referenced by (4)

Subject (surface form when different)	Predicate
Martin Davis → Martin Davis ("Davis–Putnam–Logemann–Loveland procedure") →	knownFor
Martin Davis → Martin Davis ("Davis–Putnam–Logemann–Loveland algorithm") →	notableWork