(数理逻辑课件）MLChapter04ResolutionPrinciple.ppt

超级计算学院 数理逻辑 第 4 章 ResolutionPrinciple Chapter 4 Resolution principle Substitution Unification Predicate Resolvent Reference book: Nils Nilsson, Principle of Artificial Intelligence, Chapter 4-6 4.1 substitution  Many intelligent systems require the capability for representing, retrieving and manipulating set of statements. why we need substitution ?  We need P(x) and P(a) unification substitution: a set of pairs {t1/v1, t2/v2, … , tn/vn} where t1, t2, … , tn are terms, v1, v2, … , vm are variables, which different from each other, vi does not appear in ti. ?x( P(x) ? Q(x)), P(a) Q(a) The result of using a substitution s to a expression E is such a expression that each occurrence of a variable have the same term substituted for it, the result is denoted by Es. Example: E = P[x, f(y), B], s1={z/x, w/y} Es1= P[z, f(w), B],  The composition of substitutions Let s1 and s2 be two substitutions,  s1= {t1/v1, t2/v2, … , tn/vn} s2={ w1/y1, w2/y2, … , wm/ym } The composition of s1 and s2 is a substitution, which is obtained by applying s2 to the terms of s1 and then adding any pairs of s2 having variables not occurring among the variables of s1 s1={g(x,y)/z} , s2={A/x, B/y, C/w, d/z}s1s2 = {g(A,B)/z, A/x, B/y, C/w} Sometimes, we need to do some arrangement, delete some redundant terms. For example: s1={g(x,y)/z, y/u} , s2={A/x, u/y, C/w, d/z}s1s2 = {g(A,u)/z, u/u, A/x, B/y, C/w} We should delete u/u. The composition of substitutions is associative:(s1s2)s3=s1(s2s3)But it is not commutative, it is not generally the case thats1s2=s2s1 unification: let E1 and E2 be two expressions, s be a substitution, if E1s = E2s, then E1 and E2 are called unifiable and s is called the unifier for them. Set E1= P[x, f(y), B], E2= P[x,