[物理]第5章 专家系统 尹朝庆 人工智能与专家系统 第二版.ppt

例5.9 写出求解农夫过河问题的初始事实与规则集。 ；；；Initial state ( deffacts inintial-positions ( status o initial-setup no-parent shore1 shore1 shore1 shore1 )) ( deffacts opposites ( opposite-of shore1 shore2 ) (opposite-of shore2 shore1)) ；；；Rules ( defrule move-alone “ ” (status ?num ?name ?fs ?xs ?gs ?cs ) (opposite-of ?fs ?ns ) (bind ?nn (gensym )) (assert (status(+1 ?num ) ?nn ?name ?ns ?xs ?gs ?cs ))) ( defrule move-with-fox “” (status ?num ?name ? ?fs ?fs ?gs ?cs ) (opposite-of ?fs ?ns ) (bind ?nn ( gensym )) (assert ( status(+1 ?num ) ?nn ?name ?ns ?ns ?gs ?cs ))) (defrule move-with-goat “ ” ( status ?num ?name ? ?fs ?xs ?fs ?cs ) ( opposite-of ?fs ?ns ) ( bind ?nn ( gensym )) ( assert ( status (+1 ?num ) ?nn ?name ?ns ?xs ?ns ?cs ))) ( defrule move-with-cabbage “ ” (status ?num ?name ? ?fs ?xs ?gs ?fs ) ( opposite-of ?fs ?ns ) ( bind ?nn ( gensym )) ( assert( status(+1 ?num ) ?nn ?name ?ns ?xs ?gs ?ns ))) ( defrule fox-eats-goat “ ” ( declare ( salience 8000 )) ?rm← (status ? ?name ? ?s1 ?s2 ~?s1 ?s2 ? ) ( retract ?rm )) (defrule goat-eats-cabbage “ ” (declare ( salience 8000 )) ?rm ←(status ? ?name ? ?s1 ? ?s2 ~?s1 ?s2) (retract ?rm )) (defrule circular-path “　” (declare (salience 9000 )) (status ?num ? ? ?fs ?xs ?gs ?cs ) ?rm ←(status ?num1 (≤ ?num ?num1 ) ? ? ?fs ?xs ?gs ?cs ) ( retract ?rm )) (defrule reasoning-end “ ” (declare (salience 10000 )) (status ? ? ? shore2 shore2 shore2 shore2 ) (return ) 规则R1是农夫单独过河规则move-alone 。 规则R2是农夫带狐狸过河规则move-with-fox 。 规则R3是农夫带山羊过河规则move-with-goat。 规则R4是农夫带白菜过河规则move-with-cabbage 。 规则R5是狐狸吃山羊规则fox-eats-goat。 规则R6是山羊吃白菜规则goat-eats-cabbage。 规则R7的规则名是circular-path ，它将从工作存储 器中删除重复的状态事实。 规则R8是结束推理过程的规则reasoning-end 。 CLIPS的推理机制 若存在一个通代σ，使得规则 if P1， P