Jean-Charles Régin

Learn More
The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effective fashion. There are two classes of propagation algorithms for general constraints: fine-grained algorithms where the removal of a value for a variable will be propagated to the corresponding(More)
In the last twenty years, many algorithms and heuristics were developed to find solutions in constraint networks. Their number increased to such an extent that it quickly became necessary to compare their performances in order to propose a small number of “good” methods. These comparisons often led us to consider FC or FC-CBJ associated with a “minimum(More)
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations from model-ing languages with a rich constraint language and the ability to specify search procedures and strategies that is the essence of constraint programming. In addition, OPL(More)
Constraint satisfaction problems are widely used in artiicial intelligence. They involve nding values for problem variables subject to constraints that specify which combinations of values are consistent. Knowledge about properties of the constraints can permit inferences that reduce the cost of consistency checking. In particular, such inferences can be(More)