Davis–Putnam Algorithm

The Davis–Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic formula using a resolution-based decision procedure for propositional logic. Since the set of valid first-order formulas is recursively enumerable but not recursive, there exists no general algorithm to solve this problem. Therefore, the Davis–Putnam algorithm only terminates on valid formulas. Today, the term "Davis–Putnam algorithm" is often used synonymously with the resolution-based propositional decision procedure (Davis–Putnam procedure) that is actually only one of the steps of the original algorithm.

Overview

The procedure is based on Herbrand's theorem, which implies that an unsatisfiable formula has an unsatisfiable ground instance, and on the fact that a formula is valid if and only if its negation is unsatisfiable. Taken together, these facts imply that to prove the validity of ''φ'' it is enough to prove that a ground instance of ''¬φ'' is unsatisfiable. If ''φ'' is not valid, then the search for an unsatisfiable ground instance will not terminate.

The procedure for checking validity of a formula ''φ'' roughly consists of these three parts:
* put the formula ''¬φ'' in prenex form and eliminate quantifiers
* generate all propositional ground instances, one by one
* check if each instance is satisfiable.
** If some instance is unsatisfiable, then return that ''φ'' is valid. Else continue checking.

The last part is a SAT solver based on resolution (as seen on the illustration), with an eager use of unit propagation and pure literal elimination (elimination of clauses with variables that occur only positively or only negatively in the formula).

Input: A set of clauses Φ.
Output: A Truth Value: true if Φ can be satisfied, false otherwise.

function DP-SAT(Φ)
repeat
// ''unit propagation:''
while Φ contains a unit clause do
Φ ← ''remove-from-formula''(, Φ);
for every clause ''c'' in Φ that contains ¬''l'' do
Φ ← ''remove-from-formula''(''c'', Φ);
Φ ← ''add-to-formula''(''c'' \ , Φ);
// ''eliminate clauses not in normal form:''
for every clause ''c'' in Φ that contains both a literal ''l'' and its negation ¬''l'' do
Φ ← ''remove-from-formula''(''c'', Φ);
// ''pure literal elimination:''
while there is a literal ''l'' that occurs pure in Φ do
for every clause ''c'' in Φ that contains ''l'' do
Φ ← ''remove-from-formula''(''c'', Φ);
// ''stopping conditions:''
if Φ is empty then
return true;
if Φ contains an empty clause then
return false;
// ''Davis-Putnam procedure:''
pick a literal ''l'' that occurs with both polarities in Φ
for every clause ''c'' in Φ containing ''l'' and every clause ''n'' in Φ containing its negation ¬''l'' do
// ''resolve c with n:''
''r'' ← (''c'' \ ) ∪ (''n'' \ );
Φ ← ''add-to-formula''(''r'', Φ);
for every clause ''c'' that contains ''l'' or ¬''l'' do
Φ ← ''remove-from-formula''(''c'', Φ);

At each step of the SAT solver, the intermediate formula generated is equisatisfiable, but possibly not equivalent, to the original formula. The resolution step leads to a worst-case exponential blow-up in the size of the formula.

The Davis–Putnam–Logemann–Loveland algorithm is a 1962 refinement of the propositional satisfiability step of the Davis–Putnam procedure which requires only a linear amount of memory in the worst case. It eschews the resolution for ''the splitting rule'': a backtracking algorithm that chooses a literal ''l'', and then recursively checks if a simplified formula with ''l'' assigned a true value is satisfiable or if a simplified formula with ''l'' assigned false is. It still forms the basis for today's (as of 2015) most efficient complete SAT solvers.

See also

*Herbrandization

References

*
*
*
*

Boolean algebra
Constraint programming
Automated theorem proving

{{formalmethods-stub