Abstract : Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest in automatic reformulation. This paper presents a general framework for learning implied global constraints in a constraint network assumed to be provided by a non-expert user. The learned global constraints can then be added to the network to improve the solving process. We apply our technique to global cardinality constraints. Experiments show the significance of the approach.
Type de document :
Communication dans un congrès
IJCAI'07: International Joint Conference on Artificial Intelligence, 2007, Hyderabad, India. pp.50-55, 2007
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00195896
Contributeur : Martine Peridier
<>
Soumis le : mardi 11 décembre 2007 - 16:23:05
Dernière modification le : jeudi 5 avril 2018 - 10:36:25
Christian Bessière, Remi Coletta, Thierry Petit. Learning Implied Global Constraints. IJCAI'07: International Joint Conference on Artificial Intelligence, 2007, Hyderabad, India. pp.50-55, 2007. 〈lirmm-00195896〉
