200 likes | 84.17k Views
Generalized modus ponens: with resolution. Suppose we have n atomic sentences (predicates, term = term) in our KB:q1, q2, qn- And we also have n atomic sentences in the antecedent of an implication in our KB:p1 ? p2 ? ? pn ? r- And we have a binding set ? such thatSUBST(?, pi) = SUBST(?,
E N D