A generic scheme for integrating strong consistencies into constraint solvers

Julien Vion 1 Thierry Petit 1, 2, 3 Narendra Jussien 4
4 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
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.
Type de document :
Communication dans un congrès
CSCLP, Jun 2009, Spain. pp.15, 2009
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00482021
Contributeur : Thierry Petit <>
Soumis le : vendredi 7 mai 2010 - 17:56:11
Dernière modification le : mercredi 9 septembre 2015 - 01:04:47

Identifiants

  • HAL Id : hal-00482021, version 1

Collections

Citation

Julien Vion, Thierry Petit, Narendra Jussien. A generic scheme for integrating strong consistencies into constraint solvers. CSCLP, Jun 2009, Spain. pp.15, 2009. 〈hal-00482021〉

Partager

Métriques

Consultations de la notice

97