Diagnosing Tree Structured Systems
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Diagnosis and Qualitative Reasoning. Pages 440-444.
Abstract
This paper introduces the algorithm TREE_DIAG for computing minimal diagnoses for tree structured systems. Diagnoses are computed by descending into the tree, enumerating the input combinations that might be reponsible for a given incorrect observation, and combining the diagnoses for the subtrees generating these inputs into diagnoses for the whole system. We prove soundness and correctness of the algorithm and show experimental results that indicate that it compares favorably to Reiter's hitting-set-based algorithm and El Fattah and Dechter's SAB. Extensions of the algorithm related to general acyclic systems, use of fault modes and the practical application to the software diagnosis domain are discussed.
@inproceedings{ijcai1997p65,
title = {Diagnosing Tree Structured Systems},
author = {Stumptner, Markus and Wotawa, Franz},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {440--444},
year = {1997},
note = {Diagnosis and Qualitative Reasoning},
url = {https://ijcai.org/proceedings/1997/65},
}
TY - CPAPER TI - Diagnosing Tree Structured Systems AU - Stumptner, Markus AU - Wotawa, Franz T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 440 EP - 444 UR - https://ijcai.org/proceedings/1997/65 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
