Results 1  10
of
584,306
Interval constraint logic programming
 CONSTRAINT PROGRAMMING: BASICS AND TRENDS, VOLUME 910 OF LNCS
, 1995
"... Abstract. In this paper, we present anoverview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate nary relations over IR with Cartesian products of intervals whose bounds are taken in a nite subset of I R.Variabl ..."
Abstract

Cited by 47 (5 self)
 Add to MetaCart
Abstract. In this paper, we present anoverview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate nary relations over IR with Cartesian products of intervals whose bounds are taken in a nite subset of I R
Hybrid cc with Interval Constraints
 PROC. OF THE 1ST INTERNATIONAL WORKSHOP ON HYBRID SYSTEMS: COMPUTATION AND CONTROL (HSCC’98), LNCS 1386
, 1998
"... Hybrid cc is a constraint programming language suited for modeling, controlling and simulating hybrid systems, i.e. systems with continuous and discrete state changes. The language extends the concurrent constraint programming framework with default reasoning and combinators for programming continuo ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
continuous behavior. The most important constraint systems used in Hybrid cc are nonlinear equations and ordinary differential equations over intervals. The interval constraints are crucial in that many modeling problems are only partially specified. We describe the implementation of the Hybrid cc
Interval Constraint Programming in C++
"... This paper discusses, how to extend C++ language with classes for interval function evaluation and constraint satisfaction. Three portable general purpose libraries for the tasks are being implemented: INT++, IAF++ and INC++. The main innovation of these systems is combination of algebraic and numer ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper discusses, how to extend C++ language with classes for interval function evaluation and constraint satisfaction. Three portable general purpose libraries for the tasks are being implemented: INT++, IAF++ and INC++. The main innovation of these systems is combination of algebraic
Interval Constraint Propagation
"... Abstract. Interval Constraint Propagation (ICP) is a method for solving formulas of the theory of quantifier free nonlinear arithmetic (QFNRA). This seminar paper introduces the necessary basics for understanding and performing ICP on a formula of QFNRA, describes some improvements and explores the ..."
Abstract
 Add to MetaCart
Abstract. Interval Constraint Propagation (ICP) is a method for solving formulas of the theory of quantifier free nonlinear arithmetic (QFNRA). This seminar paper introduces the necessary basics for understanding and performing ICP on a formula of QFNRA, describes some improvements and explores
Universally Quantified Interval Constraints
 PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING
, 2000
"... Nonlinear real constraint systems with universally and/or existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifierfree equivalent form by means of Cylindrical Algebraic Decompo ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
Nonlinear real constraint systems with universally and/or existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifierfree equivalent form by means of Cylindrical Algebraic
Reconstruction with interval constraints propagation
 In Proc. Conf. Computer Vision and Pattern Recognition
, 2006
"... In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account the propagation of data errors and roundoff. Image points are represented as small rectangles: As a result, the output o ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account the propagation of data errors and roundoff. Image points are represented as small rectangles: As a result, the output
From Interval Arithmetic to Interval Constraints ∗
"... Two definitions of division by an interval containing zero are compared: a functional one and a relational one. We show that the relational definition also provides interval inverses for other functions that do not have point inverses, such as max and the absolutevalue function. Applying the same a ..."
Abstract
 Add to MetaCart
are applied to numerical csps we relate the interval evaluation of an arithmetic expression to the family of solving algorithms of csps. The key to our method of bringing interval arithmetic and interval constraints under a common denominator are companion functions. These functions form an alternative
Exploiting monotonicity in interval constraint propagation
 In Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI
, 2010
"... We propose in this paper a new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), that exploits monotonicity of functions. The propagation is standard, but the MohcRevise procedure, used to filter/contract the variable domains w.r.t. an individual constraint, uses ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
We propose in this paper a new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), that exploits monotonicity of functions. The propagation is standard, but the MohcRevise procedure, used to filter/contract the variable domains w.r.t. an individual constraint, uses
An Interval Constraint System for Lattice Domains
 ACM Transactions on Programming Languages and Systems
, 2004
"... We present a generic framework for defining and solving interval constraints on any set of domains (finite or infinite) that are lattices. The approach is based on the use of a single form of constraint similar to that of an indexical used by CLP for finite domains and on a particular generic defini ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present a generic framework for defining and solving interval constraints on any set of domains (finite or infinite) that are lattices. The approach is based on the use of a single form of constraint similar to that of an indexical used by CLP for finite domains and on a particular generic
A Unified Framework for Interval Constraints and Interval Arithmetic
 In Proceedings of CP1998
, 1998
"... We are concerned with interval constraints: solving constraints among real unknowns in such a way that soundness is not affected by rounding errors. The contraction operator for the constraint x + y = z can simply be expressed in terms of interval arithmetic. An attempt to use the analogous definiti ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We are concerned with interval constraints: solving constraints among real unknowns in such a way that soundness is not affected by rounding errors. The contraction operator for the constraint x + y = z can simply be expressed in terms of interval arithmetic. An attempt to use the analogous
Results 1  10
of
584,306