Coupling CSP decomposition and diagnosis for tree-structured systems
Date
2003
Authors
Stumptner, M.
Wotawa, F.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
IJCAI-03 : proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 2003, pp.388-393
Statement of Responsibility
Conference Name
Eighteenth International Joint Conference on Artificial Intelligence (9 Aug 2003 - 15 Aug 2003 : Acapulco, Mexico)
Abstract
Decomposition methods are used to convert general constraint satisfaction problems into an equivalent tree-structured problem that can be solved more effectively. Recently, diagnosis algorithms for tree-structured systems have been introduced, but the prerequisites of coupling these algorithms to the outcome of decomposition methods have not been analyzed in detail, thus limiting their diagnostic applicability. In this paper we generalize the TREE* algorithm and show how to use hypertree decomposition outcomes as input to the algorithm to compute the diagnoses of a general diagnosis problem.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2003 the author(s)