The Davisa-Putnam procedure
Davis-Putnam procedure - a very effective system for proposing propositional statements. There are also modifications to the first order predicate calculator, but they are usually less efficient than resolutions.
The idea is as follows: the negation of the formula that we are going to prove to be replacing the alternatives of literals, ie the CNF alternative. Such CNFs are referred to here as a set of clauses, while the CNF alternative is a block.
We then remove all repetitions of literals and false, and all clauses containing literal and negative or true.
System rules: We delete each set of clauses contain an empty clause - this clause removes all others by the subtractions and has a false value, and consequently the set of clauses has a false value that is irrelevant to the block being an alternative.
If there are no associative clauses in the block, the theorem has been proved (such a block as an alternative is false - if the formula's negation is false, then the theorem is true). If there is an empty collection of clauses, this statement is false (its denial is fulfilled).
wiki
Comments
Post a Comment