Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Automatic Generation of Music Programs
CP '99 Proceedings of the 5th 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
Constructive Disjunction Revisited
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Generalizing Global Constraints Based on Network Flows
Recent Advances in Constraints
Conditional constraint satisfaction: logical foundations and complexity
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Solution directed backjumping for QCSP
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Implementing logical connectives in constraint programming
Artificial Intelligence
Domain consistency with forbidden values
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The theory of grammar constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Towards "propagation = logic + control"
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Domain consistency with forbidden values
Constraints
| Hi-index | 0.00 |
Many constraint toolkits provide logical connectives like disjunction, negation and implication. These permit complex constraint expressions to be built from primitive constraints. However, the propagation of such complex constraint expressions is typically limited. We therefore present a simple and light weight method for propagating complex constraint expressions. We provide a precise characterization of when this method enforces generalized arc-consistency. In addition, we demonstrate that with our method many different global constraints can be easily implemented.