Content deleted Content added
Avoid confusion for first-order-logicians |
|||
Line 1:
The '''Davis-Putnam algorithm''' was developed by [[Martin Davis]] and [[Hilary Putnam]] for checking the [[Boolean satisfiability problem|satisfiability]] of [[propositional logic]] formulae in [[conjunctive normal form]], ''i.e.'', sets of [[Clause (logic)|clauses]]. It is a form of [[resolution (logic)|resolution]] in which propositional variables are iteratively chosen and removed by resolving every clause in which the variable is contained positively with any clause in which the variable is negated.
The algorithm works as follows:
| |||