An Analysis of Arithmetic Constraints on Integer Intervals
Krzysztof R. Apt, Peter Zoeteweij
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.
Create a lesson
Related papers
Scaffolding Foundation Models into Physical-World Agents Pushes the Frontier of Long-Horizon Navigation
Zixing Lei, Gengze Zhou, Xiong-Hui Chen et al.
Augmenting Human Performance with an XR Agent Learning from Online Behavior and BCI Evidence
Ziheng Li, Xichen He, Haoyan Chen et al.
Will the User Ever Know? Covert Indirect Prompt Injection on Tool-Using LLM Agents
Yunseok Lee, Yunji Kim, Woojin Lee
Co-Annotator: Expert-Distilled ViT and VLM for Visual and Documentation Guidance in Age-Related Macular Degeneration
Ziheng "Leo" Li, Benjamin Freeman, Akshay Raman et al.
Answer Probing-Guided Search for Diverse Solution Exploration of LLMs
Yi Fang, Que Shen, Chengpeng Li et al.
Ignorance or Incompetence? Constructing Knowledge-Gated, Verifiable Tasks for LLM Agents
Hanlin Tian, Minhao Li, Yu Mi et al.