Diagnosing tree-structured systems
Date
2001
Authors
Stumptner, M.
Wotawa, F.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Artificial Intelligence, 2001; 127(1):1-29
Statement of Responsibility
Conference Name
Abstract
This paper introduces the TREE/TREE* algorithm for computing minimal diagnoses for tree-structured systems. Diagnoses are computed by descending into the tree, enumerating the input combinations that might be responsible for a given incorrect observation, and combining the diagnoses for the subtrees generating these inputs into diagnoses for the whole system. Algorithm TREE diagnoses systems containing functional components and algorithm TREE* diagnoses more general constraint-based components. We prove soundness and correctness of the algorithms and show experimental results that indicate that they compare favorably to Reiter's hitting-set-based algorithm and El Fattah and Dechter's SAB. Extensions of the algorithms such as use of fault modes are discussed.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright status unknown