When do bounds and domain propagation lead to the same search space?

Authors:
Christian Schulte;Peter J. Stuckey
Affiliations:
KTH---Royal Institute of Technology, Stockholm, Kista, Sweden;University of Melbourne, Australia
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
2005

Citing 14
Cited 7

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
Solving large combinatorial problems in logic programming

Journal of Logic Programming - Logic programming applications
Analysis of constraint logic programs

Proceedings of the 1990 North American conference on Logic programming
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Global analysis of constraint logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Optimizing compilation of CLP( R )

ACM Transactions on Programming Languages and Systems (TOPLAS)
The OPL optimization programming language

The OPL optimization programming language
Constraint-Based Scheduling

Constraint-Based Scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improving Linear Constraint Propagation by Changing Constraint Representation

Constraints
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Inferring Constraint Types in Constraint Programming

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Principles of Constraint Programming

Principles of Constraint Programming

An Analysis of Arithmetic Constraints on Integer Intervals

Constraints
Structural Tractability of Propagated Constraints

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
Making bound consistency as effective as arc consistency

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The complexity of integer bound propagation

Journal of Artificial Intelligence Research
View-based propagator derivation

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article explores the question of when two propagation-based constraint systems have the same behavior, in terms of search space. We categorize the behavior of domain and bounds propagators for primitive constraints, and provide theorems that allow us to determine propagation behaviors for conjunctions of constraints. We then show how we can use this to analyze CLP(FD) programs to determine when we can safely replace domain propagators by more efficient bounds propagators without increasing search space. Empirical evaluation shows that programs optimized by the analysis' results are considerably more efficient.