Deriving all minimal consistency-based diagnosis sets using SAT solvers

Abstract In this paper, a novel method is proposed for judging whether a component set is a consistency-based diagnostic set, using SAT solvers. Firstly, the model of the system to be diagnosed and all the observations are described with conjunctive normal forms (CNF). Then, all the related clauses in the CNF files to the components other than the considered ones are extracted, to be used for satisfiability checking by SAT solvers. Next, all the minimal consistency-based diagnostic sets are derived by the CSSE-tree or by other similar algorithms. We have implemented four related algorithms, by calling the gold medal SAT solver in SAT07 competition – RSAT. Experimental results show that all the minimal consistency-based diagnostic sets can be quickly computed. Especially our CSSE-tree has the best efficiency for the single- or double-fault diagnosis.

[1]  Shie-Jue Lee,et al.  Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[2]  J. Dekleer.  An assumption-based TMS , 1986 .

[3]  Ouyang Dantong,et al.  A method of combining SE-tree to compute all minimal hitting sets , 2006 .

[4]  Matthew W. Moskewicz,et al.  Engineering a (super?) efficient sat solver , 2001, Design Automation Conference.

[5]  Raymond Reiter,et al.  Characterizing Diagnoses and Systems , 1992, Artif. Intell..

[6]  Dantong Ouyang,et al.  Improved Algorithms for Deriving All Minimal Conflict Sets in Model-Based Diagnosis , 2007, ICIC.

[7]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[8]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[9]  Jussi Rintanen,et al.  Diagnosability Testing with Satisfiability Algorithms , 2007, IJCAI.

[10]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[11]  Luca Chittaro,et al.  Hierarchical model-based diagnosis based on structural abstraction , 2004, Artif. Intell..

[12]  Michael R. Genesereth,et al.  The Use of Design Descriptions in Automated Diagnosis , 1984, Artif. Intell..

[13]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[14]  Dantong Ouyang,et al.  On-Line Diagnosis of Discrete-Event Systems: A Hierarchical Approach , 2008, 2008 IEEE Conference on Robotics, Automation and Mechatronics.

[15]  Luca Console,et al.  Model-based Diagnosis in the Real World: Lessons Learned and Challenges Remaining , 1999, IJCAI.

[16]  Li Lin,et al.  The computation of hitting sets: Review and new algorithms , 2003, Inf. Process. Lett..

[17]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[18]  Franz Wotawa,et al.  A variant of Reiter's hitting-set algorithm , 2001, Inf. Process. Lett..

[19]  Lin Li,et al.  Computing Minimal Hitting Sets with Genetic Algorithm , 2002 .

[20]  Jinbo Huang,et al.  Hierarchical Diagnosis of Multiple Faults , 2007, IJCAI.