New structural decomposition techniques for constraint satisfaction problems

  • Authors:

  • Yaling Zheng;Berthe Y. Choueiry

  • Affiliations:

  • Constraint Systems Laboratory, University of Nebraska-Lincoln;Constraint Systems Laboratory, University of Nebraska-Lincoln

  • Venue:
  • CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.