Reducing redundancy in the hypertree decomposition scheme

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 decom-position. 1