A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Constraint Programming Lessons Learned from Crossword Puzzles
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
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
Beyond Singleton Arc Consistency
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
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A greedy approach to establish singleton arc consistency
IJCAI'05 Proceedings of the 19th international joint conference on 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
Generalized arc consistency for positive table constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Maintaining Arc Consistency in Non-Binary Dynamic CSPs using Simple Tabular Reduction
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Journal of Artificial Intelligence Research
Extending generalized arc consistency
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
Hi-index | 0.00 |
Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to compress their representation. We show that simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports, is very often the most efficient practical approach to enforce generalized arc consistency within MAC. We also describe an optimization of STR which allows limiting the number of operations related to validity checking or search of supports. Interestingly enough, this optimization makes STR potentially rtimes faster where ris the arity of the constraint(s). The results of an extensive experimentation that we have conducted with respect to random and structured instances indicate that the optimized algorithm we propose is usually around twice as fast as the original STR and can be up to one order of magnitude faster than previous state-of-the-art algorithms on some series of instances.