#### Filter Results:

- Full text PDF available (69)

#### Publication Year

1982

2017

- This year (4)
- Last 5 years (21)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jean-Charles Régin
- AAAI
- 1994

Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. They are defined on a subset of variables by a set of tuples for which the values occuring in the same tuple are all different. In this paper, a new filtering algorithm for these… (More)

- Jean-Charles Régin
- AAAI/IAAI, Vol. 1
- 1996

A global cardinality constraint (gcc) is speci ed in terms of a set of variables X = fx1; :::; xpg which take their values in a subset of V = fv1; :::; vdg. It constrains the number of times a value vi 2 V is assigned to a variable in X to be in an interval [li; ci]. Cardinality constraints have proved very useful in many real-life problems, such as… (More)

- Christian Bessiere, Jean-Charles Régin, Roland H. C. Yap, Yuanlin Zhang
- Artif. Intell.
- 2005

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)

- Christian Bessiere, Jean-Charles Régin
- IJCAI
- 1997

- Christian Bessiere, Jean-Charles Régin
- IJCAI
- 2001

Propagating constraints is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the use of the best algorithms. But the ease of integration is also one of the concerns when implementing an algorithm in a constraint solver. This paper focuses on AC-3, which is the… (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)

- Christian Bessiere, Eugene C. Freuder, Jean-Charles Régin
- Artif. Intell.
- 1999

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)