An Algorithm to Compute Inner Approximations of Relations for Interval Constraints

Authors:
Frédéric Benhamou;Frédéric Goualard;Eric Languénou;Marc Christie
Affiliations:
-;-;-;-
Venue:
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Year:
1999

Citing 5
Cited 2

Chemical equilibrium systems as numerical test problems

ACM Transactions on Mathematical Software (TOMS)
The 40 “generic” positions of a parallel robot

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Interval Constraint Logic Programming

Selected Papers from Constraint Programming: Basics and Trends
A Constraint Satisfaction Approach to a Circuit Design Problem

A Constraint Satisfaction Approach to a Circuit Design Problem

Interval Constraints: Results and Perspectives

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Modeling Camera Control with Constrained Hypertubes

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interval constraint-based solvers are valuable tools to scientists and engineers since they ensure many useful properties such as completeness of the result. However, their lack of soundness is sometimes a major flaw. This paper presents an algorithm ensuring soundness by computing inner approximations of real relations using only "traditional" numerical methods. A slight modification of the algorithm permits handling constraint systems with one universally quantified variable. An application to declarative modelling of camera movements is also described.