This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bounds propagators for primitive constraints, and provide theorems that allow us to determine propagation behaviours for conjunctions of constraints. We then show how we can use this to analyse CLP(FD) programs to determine when we can safely replace domain propagators by more efficient bounds propagators without increasing search space. Keywords Constraint (logic) programming, finite domain constraints, bounds propagation, domain propagation, abstract interpretation, program analysis 1
International audienceThis article presents new work on analyzing the behaviour of a constraint solv...
CSP instances are commonly solved by backtracking search combined with constraint propagation. Durin...
. We provide here a simple, yet very general framework that allows us to explain several constraint ...
This paper explores the question of when two propagation-based constraint systems have the same beha...
This article explores the question of when two propagation-based constraint systems have the same be...
At a conference such as CPAIOR, we have experts from many different approaches to searching huge com...
. Propagation based finite domain solvers provide a general mechanism for solving combinatorial prob...
AbstractConstraint logic programming is often described as logic programming with unification replac...
Constraint Logic Programming solvers on finite domains use constraints to prune those combinations o...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
Abstract: Despite successful application of constraint programming (CP) to solving many real-life pr...
In Constraint Programming, constraint propagation is a basic component of constraint satisfaction ...
Modern constraint solvers do trot require constraints to l), represented using ally particular data ...
In this paper we present a novel extension to the constraint logic programming on Finite Domains (cl...
In this paper we investigate whether we can improve propagationbased finite domain constraint solvin...
International audienceThis article presents new work on analyzing the behaviour of a constraint solv...
CSP instances are commonly solved by backtracking search combined with constraint propagation. Durin...
. We provide here a simple, yet very general framework that allows us to explain several constraint ...
This paper explores the question of when two propagation-based constraint systems have the same beha...
This article explores the question of when two propagation-based constraint systems have the same be...
At a conference such as CPAIOR, we have experts from many different approaches to searching huge com...
. Propagation based finite domain solvers provide a general mechanism for solving combinatorial prob...
AbstractConstraint logic programming is often described as logic programming with unification replac...
Constraint Logic Programming solvers on finite domains use constraints to prune those combinations o...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
Abstract: Despite successful application of constraint programming (CP) to solving many real-life pr...
In Constraint Programming, constraint propagation is a basic component of constraint satisfaction ...
Modern constraint solvers do trot require constraints to l), represented using ally particular data ...
In this paper we present a novel extension to the constraint logic programming on Finite Domains (cl...
In this paper we investigate whether we can improve propagationbased finite domain constraint solvin...
International audienceThis article presents new work on analyzing the behaviour of a constraint solv...
CSP instances are commonly solved by backtracking search combined with constraint propagation. Durin...
. We provide here a simple, yet very general framework that allows us to explain several constraint ...
Add to ORKG