An Analysis of Arithmetic Constraints on Integer Intervals

Simple item page
dc.creatorApt, Krzysztof R.
dc.creatorZoeteweij, Peter
dc.date2006-07-06
dc.date2007-03-21
dc.date.accessioned2026-07-07T07:52:46Z
dc.date.available2026-07-07T07:52:46Z
dc.descriptionArithmetic 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.
dc.description44 pages, to appear in 'Constraints' journal
dc.identifierhttps://arxiv.org/abs/cs/0607016
dc.identifierhttp://arxiv.org/abs/cs/0607016
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126002
dc.subjectArtificial Intelligence
dc.subjectProgramming Languages
dc.subjectD.3.2; D.3.3
dc.titleAn Analysis of Arithmetic Constraints on Integer Intervals
dc.typetext

Files

Collections

arXiv