Variable ranges in linear constraints

We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linearrange constraints is provided in terms of parameterized linear systems. We devise procedures for checking satisfiability and for entailing the maximal width of a variable. An extension of the constraint logic programming language CLP(R) is proposed by admitting linear-range constraints. Categories and Subject Descriptors D.3.2 [Language Classifications]: Constraint and logic languages; D.3.3 [Language Constructs and Features]: Constraints Keywords Linear constraints, Constraint Logic Programming, Interval Arithmetic, Parameterized Polyhedra.

• Type: Conference
• Year: 2010
• Where: SAC
• Authors: Salvatore Ruggieri, Fred Mesnard
• Keywords: Applied Computing, Constraint Logic Programming, Linear Constraints, Linearrange Constraints, SAC 2010