Chap16 谓词演算中的归结 人工智能课程 上海交大.ppt

第1 6章 谓词演算中的归结 Outline Unification Predicate-Calculus Resolution Completeness and Soundness Converting Arbitrary wffs to Clause Form Using Resolution to Prove Theorems Answer Extraction The Equality Predicate Additional Readings and Discussion 16.1 合一 Abbreviating wffs of the form by , where are literals that might contain occurrences of the variables Simply dropping the universal quantifiers and assuming universal quantification of any variables in the Clauses: WFFs in the abbreviated form If two clauses have matching but complementary literals, it is possible to resolve them Example: , 16.1合一(Cont’d) Unification: A process that computes the appropriate substitution Substitution instance of an expression is obtained by substituting terms for variables in that expression. Four substitution instances of are The first instance is called an alphabetic variant. The last of the four different variables is called a ground instance (A ground term is a term that contains no variables). 16.1合一(Cont’d) Any substitution can be represented by a set of ordered pairs The pair means that term is substituted for every occurrence of the variable throughout the scope of the substitution. No variables can be replaced by a tern containing that same variable. The substitutions used earlier in obtaining the four instances of ws denotes a substitution instance of an expression w, using a substitution s. Thus, The composition s1 and s2 is denoted by s1s2, which is that substitution obtained by first applying s2 to the terms of s1 and then adding any pairs of s2 having variables not occurring among the variables of s1. Thus, 16.1合一(Cont’d) Let w be P(x,y), s1 be {f(y)/x}, and s2 be {A/y} then, and Substitutions are not, in general, c