A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Symmetry Breaking using Value Precedence
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The range and roots constraints: specifying counting and occurrence problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Circuit complexity and decompositions of global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reformulating global constraints: the slide and regular constraints
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Encodings of the SEQUENCE constraint
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
Decomposition of the NVALUE constraint
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
General symmetry breaking constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The range constraint: algorithms and implementation
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Translation-based constraint answer set solving
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
| Hi-index | 0.00 |
Constraints can be exploited in paradigms outside of constraint programming. In particular, powerful global constraints can often be decomposed into small primitives and these decompositions can simulate complex propagation algorithms that perform sophisticated inference about a problem. We illustrate this approach with examples of exploiting constraints in propositional satisfiability (SAT), pseudo-Boolean (PB) solving, integer linear programming (ILP) and answer set programming (ASP).