Arc-consistency and arc-consistency again
Artificial Intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
A fast pseudo-boolean constraint solver
Proceedings of the 40th annual Design Automation Conference
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
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Dynamic variable elimination during propagation solving
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Efficient constraint propagation engines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generalised arc consistency for the AllDifferent constraint: An empirical survey
Artificial Intelligence
How Hard is a Commercial Puzzle: the Eternity II Challenge
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
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
Modelling equidistant frequency permutation arrays: an application of constraints to mathematics
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Maintaining state in propagation solvers
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Implementing logical connectives in constraint programming
Artificial Intelligence
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
A pearl on SAT solving in prolog
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A pearl on SAT and SMT solving in Prolog
Theoretical Computer Science
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
An automated approach to generating efficient constraint solvers
Proceedings of the 34th International Conference on Software Engineering
An optimal filtering algorithm for table constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Towards solver-independent propagators
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
View-based propagator derivation
Constraints
Short and long supports for constraint propagation
Journal of Artificial Intelligence Research
Variable elimination in binary CSP via forbidden patterns
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
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 |
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the satisfiability community, can be used to provide highly efficient implementations of constraint propagators. We describe three important aspects of watched literals as we apply them to constraints, and how they are implemented in the Minion constraint solver. We show three successful applications of to constraint propagators: the sum of Boolean variables; GAC for the ‘element' constraint; and GAC for the ‘table' constraint.