Finite domain bounds consistency revisited

Authors:
C. W. Choi;W. Harvey;J. H. M. Lee;P. J. Stuckey
Affiliations:
Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong SAR, N.T., China;CrossCore Optimization Ltd, London, United Kingdom;Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong SAR, N.T., China;NICTA Victoria Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 12
Cited 16

CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
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
Propagation Completeness of Reactive Constraints

ICLP '02 Proceedings of the 18th International Conference on Logic 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
A Global Constraint Combining a Sum Constraint and Difference Constraints

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Arc Consistency on n-ary Monotonic and Linear Constraints

CP '02 Proceedings of the 6th 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
When do bounds and domain propagation lead to the same search space

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Constraint Processing

Constraint Processing
Principles of Constraint Programming

Principles of Constraint Programming
Consistency techniques for numeric CSPs

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
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

Dynamic variable elimination during propagation solving

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Perfect Derived Propagators

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)
Dynamic Analysis of Bounds Versus Domain Propagation

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Propagating systems of dense linear integer constraints

Constraints
Local consistency for extended CSPs

Theoretical Computer Science
Bounds arc consistency for weighted CSPs

Journal of Artificial Intelligence Research
Non-binary quantified CSP: algorithms and modelling

Constraints
Solving the salinity control problem in a potable water system

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
CP and IP approaches to cancer radiotherapy delivery optimization

Constraints
The complexity of integer bound propagation

Journal of Artificial Intelligence Research
Lazy explanations for constraint propagators

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Optimizing inequality joins in datalog with approximated constraint propagation

PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
View-based propagator derivation

Constraints
A constraint propagation approach to structural model based image segmentation and recognition

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propagators for arithmetic constraints and several global constraints in the finite integer domain. However, there has been some confusion in the definition of bounds consistency and of bounds propagators. We clarify the differences among the three commonly used notions of bounds consistency in the literature. This serves as a reference for implementations of bounds propagators by defining (for the first time) the a priori behavior of bounds propagators on arbitrary constraints.