An Analysis of Arithmetic Constraints on Integer Intervals

Authors:
Krzysztof R. Apt;Peter Zoeteweij
Affiliations:
CWI, Amsterdam, The Netherlands 1090 GB and University of Amsterdam, Amsterdam, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands 2600 GA
Venue:
Constraints
Year:
2007

Citing 8
Cited 4

CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A proof theoretic view of constraint programming

Fundamenta Informaticae - Special issue on foundations of constraint programming
Revising hull and box consistency

Proceedings of the 1999 international conference on Logic programming
Interval arithmetic: From principles to implementation

Journal of the ACM (JACM)
Improving Linear Constraint Propagation by Changing Constraint Representation

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

ACM Transactions on Programming Languages and Systems (TOPLAS)
Controlled propagation in continuous numerical constraint networks

Proceedings of the 2005 ACM symposium on Applied computing
Principles of Constraint Programming

Principles of Constraint Programming

Generalising Constraint Solving over Finite Domains

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
An analysis of slow convergence in interval propagation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The complexity of integer bound propagation

Journal of Artificial Intelligence Research
The finite domain constraint solver of SWI-Prolog

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for these constraints. To describe them we introduce integer interval arithmetic. Each approach is explained using appropriate proof rules that reduce the variable domains. We compare these approaches using a set of benchmarks. For the most promising approach we provide results that characterize the effect of constraint propagation.