Inference in first-order logic
Inference in first-order logic
Inference in first-order logic
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Generalized Modus Ponens (GMP)<br />
p 1 ′ , p 2 ′ , ..., p n ′ , (p 1 ∧ p 2 ∧ ... ∧ p n → q)<br />
qθ<br />
where UNIFY(p i ′ ,p i ) =θ for all i<br />
p ′ 1 is K<strong>in</strong>g(John)<br />
p ′ 2 is Greedy(y)<br />
θ is {x/John,y/John}<br />
qθ is Evil(John)<br />
p 1 is K<strong>in</strong>g(x)<br />
p 2 is Greedy(x)<br />
q is Evil(x)<br />
♦ GMP used with KB of def<strong>in</strong>ite clauses (exactly one positive<br />
literal)<br />
♦ All variables assumed universally quantified<br />
<strong>Inference</strong> <strong>in</strong> <strong>first</strong>-<strong>order</strong> <strong>logic</strong> – 11
Change language