DocumentCode
399588
Title
Reducing redundancy in the hypertree decomposition scheme
Author
Harvey, Peter ; Ghose, Aditya
Author_Institution
Sch. of Inf. Technol. & Comput. Sci., Univ. of Wollongong, NSW, Australia
fYear
2003
fDate
3-5 Nov. 2003
Firstpage
474
Lastpage
481
Abstract
Hypertree decomposition is a powerful technique for transforming near-acyclic CSPs into acyclic CSPs. Acyclic CSPs have efficient, polynomial time solving techniques, and so these conversions are of interest to the constraints community. We present here an improvement on the opt-k-decomp algorithm for finding an optimal hypertree decomposition.
Keywords
artificial intelligence; computational complexity; constraint handling; constraint theory; optimisation; problem solving; trees (mathematics); NP-completeness; acyclic CSP; constraint programming; constraint satisfaction problem; hypertree decomposition; near-acyclic CSP; opt-k-decomp algorithm; optimal decomposition; redundancy reduction; Artificial intelligence; Australia Council; Computer science; Couplings; Industry applications; Laboratories; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools with Artificial Intelligence, 2003. Proceedings. 15th IEEE International Conference on
ISSN
1082-3409
Print_ISBN
0-7695-2038-3
Type
conf
DOI
10.1109/TAI.2003.1250227
Filename
1250227
Link To Document