Interval constraint satisfaction tool INC++

Localization of a Vehicle: A Dynamic Interval Constraint Satisfaction Problem-Based Approach

“…The concept of the contractor is directly inspired by the ubiquitous concept of filtering algorithms in constraint programming. Given a constraint c relating a set of variable x, an algorithm C is called a contractor (or filtering algorithm) if C returns a subdomain of the input domain x and the resulting subdomain C x contains all the feasible points with respect to the constraint c: Hyvönen et al proposed, in 1993, "INC++" [41], a basic interval processing tool which allows evaluating interval functions and aims at solving ICSP. Many other interval solvers such as Numerica [42], RealPaver [43], ALIAS [44], ICOS [45], GloptLab [46], and IBEX (IBEX is available at http://www.ibex-lib.org/) [47,48] have been designed so far.…”

javaset

“…Thanks to the encapsulation and operator overloading mechanisms, programmers can view constraints almost as if they really were part of the language. Among other proposals that take a similar approach we can mention INC++ [11], NeMo+ [16], and JSolver [2], as concerns the addition of constraints to OO languages, while Frappè [3] and Gisela [10] are two proposals that face the more general problem of making declarative programming features available in a conventional programming environment, though focusing on some specific applications. Another proposal that can be cited in this context is tuProlog [5], a Java package that implements Prolog.…”