Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems
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. 1
Cite
Text
Stumptner and Wotawa. "Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Stumptner and Wotawa. "Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/stumptner2003ijcai-coupling/)BibTeX
@inproceedings{stumptner2003ijcai-coupling,
title = {{Coupling CSP Decomposition Methods and Diagnosis Algorithms for Tree-Structured Systems}},
author = {Stumptner, Markus and Wotawa, Franz},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {388-393},
url = {https://mlanthology.org/ijcai/2003/stumptner2003ijcai-coupling/}
}