3 Mar 2004
CS3243 - Inference
17
Generalized Modus Ponens (GMP)
lp1', p2', … , pn', ( p1 Ù p2 Ù … Ù pn Þq)
qθ
p1' is King(John) p1 is King(x)
lp2' is Greedy(y) p2 is Greedy(x)
lθ is
{x/John,y/John} q is Evil(x)
q θ is Evil(John)
lGMP used with KB of definite clauses (exactly one positive literal)
lAll variables assumed universally quantified
where pi'θ = pi θ for all i
