Abstract
Model-based diagnosis is one of the active branches of Artificial Intellgence. Conflict recognition, aiming at generating all minimal conflict sets (MCSs), and candidate generation, aiming at generating all minimal hitting sets (MHSs), are of the two important steps towards to the final diagnosis results. Firstly an SE-tree based algorithm (CSSE-tree) for deriving all MCSs is given. Then a concept of inverse SE-tree (ISE-tree) is put forward, and an ISE-tree based algorithm (CSISE-tree) for deriving all MCSs is presented as well. Considering the similarity of generation of all MCSs and all MHSs for the collection of all MCSs, a uniform framework for deriving all MCSs and MHSs is proposed, too. Experimental results show that our algorithms have better efficiency than others in some situations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kleer, J.D., Kurien, J.: Fundamentals of Model-Based Diagnosis. In: Proceedings of the Fifth IFAC Symposium on Fault Detection, Supervision and Safety of Technical Processes (Safeprocess), pp. 25–36 (2003)
Jiang, Y., Lin, L.: The Computation of Hitting Sets with Boolean Formulas. Chinese Journal of Computers 26(8), 919–924 (2003)
Ouyang, D., Ouyang, J., Liu, D.: The Research and Development on Model-Based Diagnosis. Acta Scientiarum Naturalium Universitatis Jilinensis, 38–45 (2001)
Kleer, J.D.: Local Methods for Localizing Faults in Electronic Circuits. Cambridge, MA, MIT AI Memo 394 (1976)
Kleer, J.D.: An Assumption-Based TMS. Artificial Intelligence 28(2), 127–162 (1986)
Genesereth:The Use of Design Descriptions in Automated Diagnosis. Artificial Intelligence (24), 411–436 (1984)
Garey, J.D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Murray Hill, NJ, Bell Labs (1979)
Hou, A.: A Theory of Measurement in Diagnosis from First Principles. Artificial Intelligence 65(2), 281–328 (1994)
Han, B., Lee, S.J.: Deriving Minimal Conflict Sets by CS-trees with Mark Set in Diagnosis from First Principles. IEEE Transactions on Systems, Man, and Cybernetics 29(2), 281–286 (1999)
Han, B.: Diagnosis of Combinatorial Digital Circuits from First Principles. Master’s Thesis, Institute of Electrical Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan, 1996. 1st rev (November 1997)
Rymon, R.: Search Through Systematic Set Enumeration. In: Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, pp. 539–550 (1992)
Zhao, X., Ouyang, D.: A Method of Combining SE-Tree to Compute All Minimal Hitting Sets. Progress in Natural Science 16(2), 169–174 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhao, X., Ouyang, D. (2007). Improved Algorithms for Deriving All Minimal Conflict Sets in Model-Based Diagnosis. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-74171-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74170-1
Online ISBN: 978-3-540-74171-8
eBook Packages: Computer ScienceComputer Science (R0)