artificial-intelligence - 如何应用梳子法？

Question

我正在研究梳子方法，以减少模糊逻辑规则的“组合爆炸”。有一个示例，摘自“Programming Game AI from example”(由 Mat Buckland 撰写):

The theory behind the Combs method works on the principle that a rule such as:

IF Target_Far AND Ammo_Loads THEN Desirable

is logically equivalent to: IF Target_Far THEN Desirable OR IF Ammo_Loads THEN Desirable

Using this principle, a rule base can be defined that contains only one rule per consequent member set. For example, the nine rules for the desirability of the rocket launcher given previously:

Rule 1. IF Target_Far AND Ammo_Loads THEN Desirable

Rule 2. IF Target_Far AND Ammo_Okay THEN Undesirable

Rule 3. IF Target_Far AND Ammo_Low THEN Undesirable

Rule 4. IF Target_Medium AND Ammo_Loads THEN VeryDesirable

Rule 5. IF Target_Medium AND Ammo_Okay THEN VeryDesirable

Rule 6. IF Target_Medium AND Ammo_Low THEN Desirable

Rule 7. IF Target_Close AND Ammo_Loads THEN Undesirable

Rule 8. IF Target_Close AND Ammo_Okay THEN Undesirable

Rule 9. IF Target_Close AND Ammo_Low THEN Undesirable

can be reduced to six rules:

Rule 1. IF Target_Close THEN Undesirable

Rule 2. IF Target_Medium THEN VeryDesirable

Rule 3. IF Target_Far THEN Undesirable

Rule 4. IF Ammo_Low THEN Undesirable

Rule 5. IF Ammo_Okay THEN Desirable

Rule 6. IF Ammo_Loads THEN VeryDesirable

我不明白他是如何减少这些规则的!我将每个起始规则分成两部分(应用开头 A 和 B => C 中的原则等同于 A => C OR B => C)。现在是否有可遵循的模式，或者最后的 6 条规则独立于开始的 9 条规则？

Answer 1

第一个问题是运算符。这不仅仅是而且如果那么......在这里您可以找到有关 IF/THEN 运算符的更多信息:http://www.math.hawaii.edu/~ramsey/Logic/IfThen.html

但“如何减少”的问题仍然悬而未决