loading...
Reducing Redundancy in the Hypertree Decomposition Scheme
Sacramento, California, USA November 03-November 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TAI.2003.125022715th IEEE International Conference on ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Peter Harvey, University of Wollongong
Aditya Ghose, University of Wollongong
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.