The AllDifferent Constraint with Precedences
نویسندگان
چکیده
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global constraint including instruction scheduling and symmetry breaking. We give an efficient propagation algorithm that enforces bounds consistency on this global constraint. We show how to implement this propagator using a decomposition that extends the bounds consistency enforcing decomposition proposed for the ALLDIFFERENT constraint. Finally, we prove that enforcing domain consistency on this global constraint is NP-hard in general.
منابع مشابه
Explaining alldifferent
Lazy clause generation is a powerful approach to reducing search in constraint programming. For use in a lazy clause generation solver, global constraints must be extended to explain themselves. Alternatively they can be decomposed into simpler constraints which already have explanation capability. In this paper we examine different propagation mechanisms for the alldifferent constraint, and sh...
متن کاملAn Alldifferent Constraint Solver in SMT
The finite domain alldifferent constraint, requiring that all given variables have different values, is one of the fundamental global constraints in constraint programming (CP). Many filtering algorithms for alldifferent have been developed and successfully used in CP. Combining these with state-of-the-art SAT solvers is a promising research direction. Support for alldifferent within SMT solver...
متن کاملThe Alldifferent Constraint: Exploiting Strongly-connected Components and Other Efficiency Measures
The AllDifferent constraint is a crucial component of any constraint toolkit, language or solver, since it is very widely used in a variety of constraint models. The literature contains many different versions of this constraint, which trade strength of inference against computational cost. In this paper, we focus on the highest strength of inference (enforcing a property known as generalised a...
متن کاملSolving finite-domain linear constraints in presence of the $\texttt{alldifferent}$
In this paper, we investigate the possibility of improvement of the widelyused filtering algorithm for the linear constraints in constraint satisfaction problems in the presence of the alldifferent constraints. In many cases, the fact that the variables in a linear constraint are also constrained by some alldifferent constraints may help us to calculate stronger bounds of the variables, leading...
متن کاملA Probabilistic Study of Bound Consistency for the Alldifferent Constraint
This paper introduces a mathematical model for bound consistency of the constraint AllDifferent. It allows us to compute the probability that the filtering algorithm effectively removes at least one value in the variable domains. A complete study of the bound consistency properties is then proposed. It identifies several behaviors depending on some macroscopic quantities related to the variable...
متن کامل