- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

Most interval-based solvers in the constraint logic programming framework are based on either hull consistency or box consistency (or a variation of these ones) to narrow domains of variables… (More)

Sequencing constraints have proved very useful in many real-life problems such as rostering or car sequencing problems. They are used to express constraints such as: every sequence of 7 days of work… (More)

- Jean-François Puget
- ISMIS
- 1993

Constraint satisfaction problems (CSP) are a class of combinatorial problems that can be solved efficiently by combining consistency methods such as arc-consistency together with a backtracking… (More)

- Irvin Lustig, Jean-François Puget
- Interfaces
- 2001

Arising from research in the computer science community, constraint programming is a fairly new technique for solving optimization problems. For those familiar with mathematical programming, a number… (More)

- Jean-François Puget
- CP
- 2002

Symmetries in constraint satisfaction problems (CSPs) are one of the difficulties that practitioners have to deal with. We present in this paper a new method based on the symmetries of decisions… (More)

- Jean-François Puget
- IJCAI
- 2005

Adding symmetry breaking constraints is one of the oldest ways of breaking variable symmetries for CSPs. For instance, it is well known that all the symmetries for the pigeon hole problem can be… (More)

- Jean-François Puget
- CP
- 2005

Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all the symmetries of a CSP.… (More)

- Ian P. Gent, Karen E. Petrie, Jean-François Puget
- Handbook of Constraint Programming
- 2006

Publisher Summary This chapter reviews that symmetry in constraints has always been important but in recent years has become a major research area in its own right. A key problem in constraint… (More)

- Jean-François Puget
- AAAI/IAAI
- 1998

Some n-ary constraints such as the alldiff constraints arise naturally in real life constraint satisfaction problems (CSP). General purpose filtering algorithms could be applied to such constraints.… (More)

- Pascal Van Hentenryck, Laurent Perron, Jean-François Puget
- ACM Trans. Comput. Log.
- 2000

OPL is a modeling language for mathematical programming and combinatorial optimization. It is the first language to combine high-level algebraic and set notations from mathematical modeling languages… (More)