International audienceDomains in Continuous Constraint Programming (CP) are generally represented with intervals whose $n$-ary Cartesian product (box) approximates the solution space. This paper proposes a new representation for continuous variable domains based on octagons. We generalize local consistency and split to this octagon representation, and we propose an octagonal-based branch and prune algorithm. Preliminary experimental results show promising performance improvements on several classical benchmarks
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...
International audienceIn this article, we apply techniques from Abstract Interpretation (a general t...
International audienceDomains in Continuous Constraint Programming (CP) are generally represented wi...
International audienceIn Constraint Programming (CP), the central notion of consistency can be defin...
Abstract. The octagon abstract domain, devoted to discovering octagonal con-straints (also called Un...
International audienceThe octagon abstract domain, devoted to discovering octagonal constraints (als...
Optimization is a very important field for getting the best possible value for the optimization func...
Interval constraint solvers use local consistencies—among which one worth mentioning is box consiste...
Constraint programming is often associated with solving problems over finite domains. Many applicati...
International audienceA particular data structure named a Quad Tree allows a better representation o...
Constraint Programming aims at solving hard combinatorial problems, with a computation time increasi...
International audienceInterval-based methods can approximate all the real solutions of a system of e...
This paper addresses constraint solving over continuous domains in the context of decision making, a...
Constraint programming is a paradigm wherein relations between variables are stated in the form of ...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...
International audienceIn this article, we apply techniques from Abstract Interpretation (a general t...
International audienceDomains in Continuous Constraint Programming (CP) are generally represented wi...
International audienceIn Constraint Programming (CP), the central notion of consistency can be defin...
Abstract. The octagon abstract domain, devoted to discovering octagonal con-straints (also called Un...
International audienceThe octagon abstract domain, devoted to discovering octagonal constraints (als...
Optimization is a very important field for getting the best possible value for the optimization func...
Interval constraint solvers use local consistencies—among which one worth mentioning is box consiste...
Constraint programming is often associated with solving problems over finite domains. Many applicati...
International audienceA particular data structure named a Quad Tree allows a better representation o...
Constraint Programming aims at solving hard combinatorial problems, with a computation time increasi...
International audienceInterval-based methods can approximate all the real solutions of a system of e...
This paper addresses constraint solving over continuous domains in the context of decision making, a...
Constraint programming is a paradigm wherein relations between variables are stated in the form of ...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...
International audienceIn this article, we apply techniques from Abstract Interpretation (a general t...