Data structures for generalised arc consistency for extensional constraints

Authors:
Ian P. Gent;Chris Jefferson;Ian Miguel;Peter Nightingale
Affiliations:
School of Computer Science, University of St Andrews, Fife, United Kingdom;Oxford University Computing Laboratory, University of Oxford, Oxford, United Kingdom;School of Computer Science, University of St Andrews, Fife, United Kingdom;School of Computer Science, University of St Andrews, Fife, United Kingdom
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Year:
2007

Citing 8
Cited 22

Trie memory

Communications of the ACM
Implementing the Davis–Putnam Method

Journal of Automated Reasoning
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence
Maintaining Generalized Arc Consistency on Ad-hoc n-ary Boolean Constraints

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
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
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

Optimization of Simple Tabular Reduction for Table Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Reformulating Positive Table Constraints Using Functional Dependencies

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Generalised arc consistency for the AllDifferent constraint: An empirical survey

Artificial Intelligence
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Type Parametric Compilation of Algebraic Constraints

EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

Constraints
A compression algorithm for large arity extensional constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint Based Planning with Composable Substate Graphs

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Domain consistency with forbidden values

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Generating special-purpose stateless propagators for arbitrary constraints

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
STR2: optimized simple tabular reduction for table constraints

Constraints
Lazy explanations for constraint propagators

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Flexible management of large-scale integer domains in CSPs

SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Dealing with Satisfiability and n-ary CSPs in a Logical Framework

Journal of Automated Reasoning
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 generalized arc consistency

SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
An optimal filtering algorithm for table constraints

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Domain consistency with forbidden values

Constraints
Short and long supports for constraint propagation

Journal of Artificial Intelligence Research
View-based propagation of decomposable constraints

Constraints
Optimal and efficient filtering algorithms for table constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagation algorithms for these constraints. We describe the use of two alternative data structures for maintaining generalised arc consistency on extensional constraints. The first, the Next-Difference list, is novel and has been developed with this application in mind. The second, the trie, is well known but its use in this context is novel. Empirical analyses demonstrate the efficiency of the resulting approaches, both in GAC-schema, and in the watched-literal table constraint in Minion.