Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 388-392.
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 treestructured 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.
@inproceedings{ijcai2003p58,
title = {Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems},
author = {Stumptner, Markus and Wotawa, Franz},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {388--392},
year = {2003},
url = {https://ijcai.org/proceedings/2003/58},
}
TY - CPAPER TI - Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems AU - Stumptner, Markus AU - Wotawa, Franz T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 388 EP - 392 UR - https://ijcai.org/proceedings/2003/58 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
