Integrating strong local consistencies into constraint solvers

  • Authors:
  • Julien Vion;Thierry Petit;Narendra Jussien

  • Affiliations:
  • Univ. Lille Nord de France, Lille, Franc and UVHC, LAMIH FRE CNRS 3304, Valenciennes, France;École des Mines de Nantes, LINA UMR CNRS 6241, Nantes, France;École des Mines de Nantes, LINA UMR CNRS 6241, Nantes, France

  • Venue:
  • CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article presents a generic scheme for adding strong local consistencies to the set of features of constraint solvers, which is notably applicable to event-based constraint solvers. We encapsulate a subset of constraints into a global constraint. This approach allows a solver to use different levels of consistency for different subsets of constraints in the same model. Moreover, we show how strong consistencies can be applied with different kinds of constraints, including user-defined constraints. We experiment our technique with a coarse-grained algorithm for Max-RPC, called Max-RPCrm, and a variant of it, L-Max-RPCrm. Experiments confirm the interest of strong consistencies for Constraint Programming tools.