A fast and simple algorithm for bounds consistency of the all different constraint

Authors:
Alejandro Lopez-Ortiz;Claude-Guy Quimper;John Tromp;Peter Van Beek
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Canada;School of Computer Science, University of Waterloo, Waterloo, Canada;CWI, Amsterdam, Netherlands;School of Computer Science, University of Waterloo, Waterloo, Canada
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 6
Cited 23

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Difference All-Difference Makes

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CSPLIB: A Benchmark Library for Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
When do bounds and domain propagation lead to the same search space

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint

Constraints
Complete Bound Consistency for the Global Cardinality Constraint

Constraints
Asynchronous aggregation and consistency in distributed constraint satisfaction

Artificial Intelligence - Special issue: Distributed constraint satisfaction
Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
Arc-B-consistency of the Inter-distance Constraint

Constraints
Global Constraint Catalogue: Past, Present and Future

Constraints
Simultaneous matchings: Hardness and approximation

Journal of Computer and System Sciences
A quadratic propagator for the inter-distance constraint

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Loop formulas for logic programs with arbitrary constraint atoms

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Constraint solving in common Lisp

Proceedings of the 2007 International Lisp Conference
Asynchronous aggregation and consistency in distributed constraint satisfaction

Artificial Intelligence - Special issue: Distributed constraint satisfaction
Decompositions of all different, global cardinality and related constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The alldifferent constraint with precedences

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Multiconsistency and robustness with global constraints

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Simultaneous matchings

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The all different and global cardinality constraints on set, multiset and tuple variables

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Finite domain bounds consistency revisited

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Better propagation for non-preemptive single-resource constraint problems

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Filtering algorithms for global chance constraints

Artificial Intelligence
Exploiting constraints

ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Theoretical Computer Science
Explaining alldifferent

ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
View-based propagation of decomposable constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and constraint propagation. Previous studies have demonstrated that designing special purpose constraint propagators for commonly occurring constraints can significantly improve the efficiency of a constraint programming approach. In this paper we present a fast, simple algorithm for bounds consistency propagation of the alldifferent constraint. The algorithm has the same worst case behavior as the previous best algorithm but is much faster in practice. Using a variety of benchmark and random problems, we show that our algorithm outperforms existing bounds consistency algorithms and also outperforms--on problems with an easily identifiable property-state-ofthe-art commercial implementations of propagators for stronger forms of local consistency.