Improved algorithms for deriving all minimal conflict sets in model-based diagnosis

17Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model-based diagnosis is one of the active branches of Artificial Inteligence. 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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Zhao, X., & Ouyang, D. (2007). Improved algorithms for deriving all minimal conflict sets in model-based diagnosis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4681 LNCS, pp. 157–166). Springer Verlag. https://doi.org/10.1007/978-3-540-74171-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free