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

Authors:
Christian Schulte;Peter J. Stuckey
Affiliations:
Universität des Saarlandes, Germany;University of Melbourne, Australia
Venue:
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2001

Citing 10
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint

Constraints
Linear Weighted-Task-Sum --- Scheduling Prioritized Tasks on a Single Resource

Applications of Declarative Programming and Knowledge Management
Dual modelling of permutation and injection problems

Journal of Artificial Intelligence Research
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
Propagation redundancy for permutation channels

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constraint-based modeling and scheduling of clinical pathways

CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Finite domain bounds consistency revisited

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the question of when two propagation-based constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bounds propagators for primitive constraints, and provide theorems that allow us to determine propagation behaviours for conjunctions of constraints. We then show how we can use this to analyse CLP(FD) programs to determine when we can safely replace domain propagators by more efficient bounds propagators without increasing search space.