@TechReport{Mann:Tack:Will:DDSintegration:CoRR2007,
  author =	 {Martin Mann and Guido Tack and Sebastian Will},
  title =	 {Decomposition During Search for Propagation-Based Constraint Solvers},
  pages =	 15,
  year =	 2007,
  user =	 {mmann},
  institution =  {ALU Freiburg},
  arxiv = {0712.2389},
  abstract =	 {We describe decomposition during search (DDS), an inte-
gration 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 li-
brary. Two applications, solution counting in graph coloring and protein
structure prediction, exemplify the benefits of DDS in practice.}
}