Solution counting algorithms for constraint-centered search heuristics

  • Authors:

  • Alessandro Zanarini;Gilles Pesant

  • Affiliations:

  • Department of Computer and Software Engineering, École Polytechnique de Montréal, Montreal, Canada C.P. 6079;Department of Computer and Software Engineering, École Polytechnique de Montréal, Montreal, Canada C.P. 6079

  • Venue:
  • Constraints
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same thing for search, proposing constraint-centered heuristics which guide the exploration of the search space toward areas that are likely to contain a high number of solutions. We first propose new search heuristics based on solution counting information at the level of individual constraints. We then describe efficient algorithms to evaluate the number of solutions of two important families of constraints: occurrence counting constraints, such as alldifferent, and sequencing constraints, such as regular. In both cases we take advantage of existing filtering algorithms to speed up the evaluation. Experimental results on benchmark problems show the effectiveness of our approach.