@TechReport{Mann:Tack:Will:_decom_durin_searc:CPAIOR2007,
  author =	 {Martin Mann and Guido Tack and Sebastian Will},
  title =	 {Decomposition During Search},
  pages =	 16,
  year =	 2007,
  user =	 {will},
  institution =  {ALU Freiburg},
  abstract =	 {We describe decomposition during search (DDS) as a novel
                  search algorithm for counting the solutions of a CSP. DDS
                  enhances standard tree search by dynamically decomposing
                  sub-problems into independent problems, avoiding redundant
                  work. The paper provides formal definitions and analysis of
                  the introduced method. We integrate DDS into a modern
                  constraint programming system, using Gecode as an
                  example. Two applications, graph coloring and protein
                  structure prediction, show the potential for huge benefits
                  of DDS in practice.}
}