Introduction to algorithms
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
The problem of compatible representatives
SIAM Journal on Discrete Mathematics
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The Difference All-Difference Makes
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Constraint Generation via Automated Theory Formation
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Graphs and Hypergraphs
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Data structures for generalised arc consistency for extensional constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Tailoring solver-independent constraint models: a case study with ESSENCE' and MINION
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Advisors for incremental propagation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Watched literals for constraint propagation in minion
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Views and iterators for generic constraint implementations
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Persistency in maximum cardinality bipartite matchings
Operations Research Letters
Implementing logical connectives in constraint programming
Artificial Intelligence
Ensemble classification for constraint solver configuration
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
CP models for maximum common subgraph problems
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Lazy explanations for constraint propagators
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
The extended global cardinality constraint: an empirical survey (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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 arc consistency (GAC). This work is an analytical survey of optimizations of the main algorithm for GAC for the AllDifferent constraint. We evaluate empirically a number of key techniques from the literature. We also report important implementation details of those techniques, which have often not been described in published papers. We pay particular attention to improving incrementality by exploiting the strongly-connected components discovered during the standard propagation process, since this has not been detailed before. Our empirical work represents by far the most extensive set of experiments on variants of GAC algorithms for AllDifferent. Overall, the best combination of optimizations gives a mean speedup of 168 times over the same implementation without the optimizations.