Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles
Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles
复制标题
DOI：
10.1109/3477.752801
复制
发表时间：
1999-04-01
影响因子：
--
通讯作者：
Lee, SJ
中科院分区：
文献类型：
--
作者：
Han, B;Lee, SJ
为了在所有可能的诊断中使用侯氏的测量理论[5]进行区分，人们必须从一个已知的冲突集推导出所有的最小冲突集。然而，由侯的方法得到的结果取决于CS-树中节点生成的顺序。我们提出了一种带标记集的派生方法来克服侯方法的这一缺点，我们还证明了我们的方法在不需要做冗余测试的意义上是更有效的，并借助于额外信息对我们的方法进行了改进。最后，讨论了自上而下和自下而上的导数。
To discriminate among all possible diagnoses using Hou's theory of measurement in diagnosis from first principles [5], one has to derive all minimal conflict sets from a known conflict set. However, the result derived from Hou's method depends on the order of node generation in CS-trees. We develop a derivation method with mark set to overcome this drawback of Hou's method, We also show that our method is more efficient in the sense that no redundant tests have to be done, An enhancement to our method with the aid of extra information is presented. Finally, a discussion on top-down and bottom-up derivations is given.