Algorithm of Davis-Putnam

In propositional calculation, the algorithm of Davis-Putnam is a method of determination of the satisfiability of a Formule in conjunctive normal Forme, i.e. a conjunction of clause S (Disjonction S of literal). It was developed by Martin Davis and Hilary Putnam.

Algorithm

for each variable in the formula

for each clause C containing the variable and each clause NR containing the negation of this variable

to solve C and NR and to add the solution to the formula

to withdraw the clauses containing the variable or its negation

Recursive algorithm

DP (T)

If T is empty then to turn over 1
If T is the empty clause then to turn over 1
Choisir a variable Xi in T
to turn over DP (T (Xi<-1)) U DP (T (Xi<-0))

See too

Clause of Horn

Random links:

Frame | Virginia Razzano | Zadar | March 14th in sport | Alurs | Institut_de_Warburg