Most interval-based solvers in the constraint logic programming framework are based on either hull consistency or box consistency (or a variation of these ones) to narrow domains of variables… (More)

The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in… (More)

RealPaver is an interval software for modeling and solving nonlinear systems. Reliable approximations of continuous or discrete solution sets are computed using Cartesian products of intervals.… (More)

We present in this paper a uni ed processing for Real, Integer and Boolean Constraints based on a general narrowing algorithm which applies to any n-ary relation on <. The basic idea is to de ne, for… (More)

Most CLP languages designed in the past few years feature at least some combination of constraint solving capabilities. These combinations can take m ultiple forms since they achieve either the… (More)

Non-linear 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… (More)

In this paper, we present a n o verview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate n-ary relations over R… (More)

A new branch-and-prune algorithm for globally solving nonlinear systems is proposed. The pruning technique combines a multidimensional interval Newton method with the constraint satisfaction… (More)