Abstract In model-based diagnosis, the candidate diagnostic results are generally characterized by all minimal hitting sets for the collection of all conflict sets. In this paper, a new method is proposed to judge a hitting set by the number of conflict sets corresponding to components, and the computing procedure is formalized by combining revised SE-tree (set enumeration tree) with closed nodes to generate all minimal hitting sets. Results show that because closed nodes are added into SE-tree, the search efficiency is highly improved. Further-more, the proposed method is easy to be understood and implemented. Compared with other effective algorithms with completeness in some experimental tests, the diagnosis efficiency of our proposed method is higher, particularly for single- and double-fauld diagnosis. * Supported by Program for New Century Excellent Talents in University, the Chinese National High Technology Research and Development Plan (Grant No. 2003AA118020), Major Research Program of National Na...
[1]
Lin Li.
Computing minimal hitting sets with logic array in model-based diagnosis
,
2002
.
[2]
Lin Li.
Computing the Minimal Hitting Sets with Binary HS-Tree
,
2002
.
[3]
Lin Li.
The Algorithms of Computing Minimal Hitting Sets in Model-based Diagnosis
,
2002
.
[4]
Franz Wotawa,et al.
A variant of Reiter's hitting-set algorithm
,
2001,
Inf. Process. Lett..
[5]
Lin Li,et al.
Computing Minimal Hitting Sets with Genetic Algorithm
,
2002
.
[6]
Ron Rymon,et al.
Search through Systematic Set Enumeration
,
1992,
KR.
[7]
Raymond Reiter,et al.
A Theory of Diagnosis from First Principles
,
1986,
Artif. Intell..
[8]
Jiang Yun.
The Computation of Hitting Sets with Boolean Formulas
,
2003
.