人工智能的课件CH9-Inference-in-FOL.pptVIP

and the relevant rules 花 ? plant 猫 ? animal 一 ? number 小 ? adj 漂亮的 ? adj 花 ? adj adj + animal ? animal adj + plant ? plant number+ 只+animal ? animal number+ 枝+plant ? plant.  A good example of recursive nature is number. A group of simplified rules for describing Chinese number are given below: MX={一，二，三，四，五，六，七，八，九} MX0={零} MW={十,百,千,万,亿,兆} MWW={万,亿,兆} MH={好些, 许多, 若干, 几, 两} MX-MX0 (r1) MX0+MX0-MMX (r2) MX0+MMX-MMX (r3) MX+MW+MX-MX (r4) MX+MW+零+MX-MX (r5) MW+MWW-MW (r6) MWW-MW (r7) MX+MW-M (r8)  十+MX-MS (r9) MS+MWW-M (r10) MS+MWW+MX-MX (r11) MX0+点+MX-M (r12) MX0+点+MMX-M (r13) MS+点+MX-M (r14) MS+点+MMX-M (r15) M+倍-MB (r16) MX0-M (r17) MMX-M (r18) MW-M (r19) MB-M (r20) MH-M (r21) MS-M (r22) Backward chaining algorithm SUBST(COMPOSE(θ1, θ2), p) = SUBST(θ2, SUBST(θ1, p)) Backward chaining example Backward chaining example Backward chaining example Backward chaining example Backward chaining example Backward chaining example Backward chaining example Backward chaining example Properties of backward chaining Depth-first recursive proof search: space is linear in size of proof Incomplete due to infinite loops ? fix by checking current goal against every goal on stack Inefficient due to repeated subgoals (both success and failure) ? fix using caching of previous results (extra space) Widely used for logic programming Logic programming: Prolog Algorithm = Logic + Control Program = set of clauses = head :- literal1, … literaln. criminal(X) :- american(X), weapon(Y), sells(X,Y,Z), hostile(Z). Depth-first, left-to-right backward chaining A set of built-in functions for arithmetic etc., e.g., X is Y*Z+3 Built-in predicates that have side effects (e.g., input and output predicates, assert/retract predicates) Closed-world assumption (negation as failure) e.g., given alive(X) :- not dead(X). alive(joe) succeeds if dead(joe) fails Prolog Appending two lists to produce a third: append([],Y,Y)