International audienceConstraint propagation is widely recognized as a fundamental reasoning component in constraint programming. In the last decade, the concept of "global constraint" has attracted significant attention, since it is critical to achieve reasonable pruning, and efficiency, in many applications. However, even if the name "global constraint" carries a strong intuition in itself, there is no formal definition of this important concept. This paper proposes various notions of globality in order to understand this concept more thoroughly
Global constraints are cardinal concepts of CLP (FD), a constraint programming language. They are me...
This report introduces a classification scheme for the global constraints. This classification is ba...
Abstract. Global constraint design is a key success of CP for solving hard com-binatorial problems. ...
Constraint propagation is widely recognized as a fundamental reasoning component in constraint prog...
We study the computational complexity of reasoning with global constraints. We show that reasoning w...
short paperInternational audienceConstraint propagation is one of the techniques central to the succ...
International audienceFinding a constraint network that will be efficiently solved by a constraint s...
Global constraints play a crucial role in solving real-life combinatorial problems thanks to encapsu...
International audienceWe study the computational complexity of reasoning with global constraints. We...
International audienceWe introduce a simple idea for deriving reified global constraints in a system...
International audienceGlobal constraints are an essential component in the efficiency of centralized...
Abstract. We study the complexity of constraint satisfaction problems involving global constraints, ...
Global Constraints: Introduction and Graph-Based Representation.Global Constraints: Introduction and...
Abstract. Global constraints are useful for modelling and reasoning about real-world combinatorial p...
Global constraints are an essential component in the efficiency of centralized constraint programmin...
Global constraints are cardinal concepts of CLP (FD), a constraint programming language. They are me...
This report introduces a classification scheme for the global constraints. This classification is ba...
Abstract. Global constraint design is a key success of CP for solving hard com-binatorial problems. ...
Constraint propagation is widely recognized as a fundamental reasoning component in constraint prog...
We study the computational complexity of reasoning with global constraints. We show that reasoning w...
short paperInternational audienceConstraint propagation is one of the techniques central to the succ...
International audienceFinding a constraint network that will be efficiently solved by a constraint s...
Global constraints play a crucial role in solving real-life combinatorial problems thanks to encapsu...
International audienceWe study the computational complexity of reasoning with global constraints. We...
International audienceWe introduce a simple idea for deriving reified global constraints in a system...
International audienceGlobal constraints are an essential component in the efficiency of centralized...
Abstract. We study the complexity of constraint satisfaction problems involving global constraints, ...
Global Constraints: Introduction and Graph-Based Representation.Global Constraints: Introduction and...
Abstract. Global constraints are useful for modelling and reasoning about real-world combinatorial p...
Global constraints are an essential component in the efficiency of centralized constraint programmin...
Global constraints are cardinal concepts of CLP (FD), a constraint programming language. They are me...
This report introduces a classification scheme for the global constraints. This classification is ba...
Abstract. Global constraint design is a key success of CP for solving hard com-binatorial problems. ...