Arc and path consistence revisited
Artificial Intelligence
Constraint Generation via Automated Theory Formation
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constructive Disjunction Revisited
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Search Strategies for Rectangle Packing
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
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
A fast arc consistency algorithm for n-ary constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Data structures for generalised arc consistency for extensional constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence
A compression algorithm for large arity extensional constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Implementing logical connectives in constraint programming
Artificial Intelligence
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
Watched literals for constraint propagation in minion
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Generalized arc consistency for positive table constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Exploiting short supports for generalised arc consistency for arbitrary constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Extending simple tabular reduction with short supports
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Optimal implementation of watched literals and more general techniques
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Special-purpose constraint propagation algorithms frequently make implicit use of short supports | by examining a subset of the variables, they can infer support (a justification that a variable-value pair may still form part of an assignment that satisfies the constraint) for all other variables and values and save substantial work - but short supports have not been studied in their own right. The two main contributions of this paper are the identification of short supports as important for constraint propagation, and the introduction of HaggisGAC, an efficient and effective general purpose propagation algorithm for exploiting short supports. Given the complexity of HAGGISGAC, we present it as an optimised version of a simpler algorithm ShortGAC. Although experiments demonstrate the efficiency of ShortGAC compared with other general-purpose propagation algorithms where a compact set of short supports is available, we show theoretically and experimentally that HaggisGAC is even better. We also find that HaggisGAC performs better than GAC-Schema on full-length supports. We also introduce a variant algorithm HaggisGAC-Stable, which is adapted to avoid work on backtracking and in some cases can be faster and have significant reductions in memory use. All the proposed algorithms are excellent for propagating disjunctions of constraints. In all experiments with disjunctions we found our algorithms to be faster than Constructive Or and GAC-Schema by at least an order of magnitude, and up to three orders of magnitude.