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
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;
Conference_Titel :
Tools with Artificial Intelligence, 2003. Proceedings. 15th IEEE International Conference on
Print_ISBN :
0-7695-2038-3
DOI :
10.1109/TAI.2003.1250227
