Pred Resolution
Pred Resolution
Extending Resolution
Resolution 315/448
Resolution Reprise
Resolution 316/448
Literals in Predicate Logic
Convention:
Literals P(g( y), f (x, h(x), y)) and P(u, f (g(z), w, z)).
Literals P(g( y), f (x, h(x), y)) and P(u, f (g(z), w, z)).
α ∨ R(t 1 , . . . , t k ) ¬R(s1 , . . . sk ) ∨ β
(α ∨ β)[r1 /x 1 ] . . . [ri /x i ]
Recall that we have assumed that all variables have universal quantifiers.
is
∀ y · P( y) → Q( f ( y), y) .
I 0 |= E ∀ y1 · . . . ∀ yk · α[ f ( y1 , . . . , yk )/x] .
When doing a resolution proof, there are three things that might
happen.
1. A contradiction is reached.
2. No new formulas can be derived by resolution.
3. Neither of the above — the process simply continues.
Since there are function symbols, the number of possible terms (and
atomic formulas) is infinite. Sometimes, applying resolution may never
end—there are always new formulas to create.
Example: Assume PA1 and PA2. In CNF, these are
1. ¬ s(x) = 0
2. ¬ s( y) = s(z) ∨ y = z .
Steps of resolution:
3. ¬ s(s(x)) = s(0) 1, 2: [s(x)/ y] [0/z]
4. ¬ s(s(s(x))) = s(s(0)) 2, 3: [s(s(x))/ y] [s(0)/z]
5. ¬ s(s(s(s(x)))) = s(s(s(0))) 2, 4: [s(s(s(x)))/ y] [s(s(0))/z]
..
. etc.