Publication details

Saarland University Computer Science

Decomposition During Search for Propagation-Based Constraint Solvers

Martin Mann, Guido Tack, Sebastian Will

Technical Report, Available from http://arxiv.org/abs/0712.2389, 2008

We describe decomposition during search (DDS), an integration of and/or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem into independent partial problems, avoiding redundant work.
The paper discusses how DDS interacts with key features that make propagation-based solvers successful: constraint propagation, especially for global constraints, and dynamic search heuristics.
We have implemented DDS for the Gecode constraint programming library. Two applications, solution counting in graph coloring and protein structure prediction, exemplify the benefits of DDS in practice.

Available from http://arxiv.org/abs/0712.2389.

Download PDF        Show BibTeX               


Login to edit


Webmaster, Wed Sep 16 10:47:00 2009