New Structural Decomposition Techniques for Constraint Satisfaction Problems

We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge decomposition and hypertree decomposition. Our experiments show that one of our techniques offers the best trade-off between the computational cost of the decomposition and the width of the resulting decomposition tree.

• Type: Conference
• Year: 2004
• Where: CSCLP
• Authors: Yaling Zheng, Berthe Y. Choueiry
• Keywords: CSCLP 2004, Decomposition, Hinge Decomposition, Structural Decomposition Techniques