(数理逻辑课件）MLChapter06RuleBasedDeduction.ppt

The combination forward and backward system The idea of the combination forward and backward system The fact of a forward deduction system can be any expressions, the goal of a backward deduction system can be any expressions, we can combine them, and get their advantages at same time. The key problem of the combination is the termination conditions. The CANCEL is defined recursively as follows: Two nodes n and m CANCEL each other if one of (n,m) is a fact node and other a goal node, And if n and m are labeled by unifying leterals, or n has an outgoing arc to a set of successors{si}, such that CANCEL(si,m) holds for each member of the set. The CANCEL is defined recursively as follows: ? P(f(y)) ?{Q(f(y),y) ? [? R(f(y)) ? ? S(y)]} {Q(f(y),y) ? [? R(f(y)) ? ? S(y)]} ? P(f(y)) ? R(f(y)) ? ? S(y) Q(f(y),y) ? S(y) ? R(f(y)) ? R(v) ? S(A) ? R(v) ? ? S(A) Q(v,A) Q(v,A) ? [? R(v) ? ? S(A)] Goal graph {A/y} {f(A)/v} Fact graph When the root node of the goal graph and the root of fact graph CNACEL each other, we have a candidate solution, The graph structure with the goal and fact graphs, that demonstrates that the goal and fact root CANCEL each other is called a candidate CANCEL graph, The candidate solution is an actual solution if all the match mgus in the candidate CANSEL graph are consistent. 数理逻辑练习 4 姓名 学号 1. 利用基于规则的推理证明如下谓词逻辑蕴涵式: {? x(P(x) → (Q(x) ? R(x))), ?y(? P (y) → ? T (y)), ?z( Q(z) → N (z))} ╞ ? u(? T (u) ? N (u)) 数理逻辑练习 5 姓名 学号 1. 叙述基于规则的反向推理证明的主要思想. 2. 利用基于规则的反向推理证明如下结论: 目标公式 : ? x? y((M(x) ? P(y) ? ? H (x, y) ) ?T(y)), 事实公式: P(a) ??Q(a) ?R(a) ?S(b) 推理规则 : R1: R(x1) ?P(x1) →G(x1) R2: G(y1) ??Q(y1) → ? H (z, y1) R3: P(u) →N(u) R4: M(v) →N(v) R5: S(w) →M(w) 数理逻辑练习 6 姓名 学号 利用基于规则的反向推理证明如下结论: 目标公式 : ? x? y((S(x) ?(