Strong consistencies for efficient solving
Anastasia Paparrizou (CRIL, CNRS - Université d'Artois)16 nov. 2017 - 14:00
It is well-known that the simultaneous satisfaction of a set of constraints is intractable in general and problems can become very difficult to solve as their size increases. Constraint Programming has developed various techniques to tackle this inherent problem. In this talk, I will speak about one of the most important such techniques which is the enforcement of a local consistency. I will mainly focus on less "traditional" local consistencies and recent promising results (presented in IJCAI’17).