On Integer Intervals: A Comparative Study of Arithmetic Constraint Propagation Methods

Title: On Integer Intervals: A Comparative Study of Arithmetic Constraint Propagation Methods

Research Question: How can we efficiently propagate arithmetic constraints on integer intervals, and how do different approaches compare?

Methodology: The authors introduce integer interval arithmetic and propose several approaches to constraint propagation. They compare these approaches using a set of benchmarks.

Results: The authors find that unlike linear constraints on integer intervals, there are multiple natural approaches to constraint propagation for these constraints. They present proof rules that reduce the variable domains and compare the performance of their proposed approaches using the benchmarks.

Implications: This research contributes to the field of constraint programming by providing a systematic study of arithmetic constraints on integer intervals and comparing different approaches to constraint propagation. The results can help improve the efficiency of constraint propagation and the performance of constraint programming systems.

Link to Article: https://arxiv.org/abs/0403016v1 Authors: arXiv ID: 0403016v1