15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03) Reducing Redundancy in the Hypertree Decomposition Scheme Sacramento, California, USA November 03-November 05 ISBN: 0-7695-2038-3
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.
Citation:
Peter Harvey, Aditya Ghose, "Reducing Redundancy in the Hypertree Decomposition Scheme," ictai, pp.474, 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||