An Analysis of Arithmetic Constraints on Integer Intervals

2006/07/06 by Krzysztof R. Apt, Apt, Krzysztof R., Peter Zoeteweij +1
Computer Science · #Constraint Satisfaction and Optimization #Data Management and Algorithms #Advanced Database Systems and Queries

paper · pdf · doi:10.48550/arxiv.cs/0607016

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. This is a full version of our earlier paper, cs.PL/0403016.

Citations

• Interval arithmetic

Related

• A Comparative Study of Arithmetic Constraints on Integer Intervals
• Using Propagation for Solving Complex Arithmetic Constraints
• A Proof Theoretic View of Constraint Programming
• Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems
• Integrating Interval Constraints into Logic Programming