Publisher Summary This chapter reviews that continuous constraint solving has been widely
studied in several fields of applied mathematics and computer science. In computer algebra …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …

The use of interval methods, in particular interval-Newton/generalized-bisection (IN/GB)
techniques, provides an approach that is mathematically and computationally guaranteed to …

With the ubiquity of multicore computing, and the likely expansion of it, it seems
irresponsible for constraints researchers to ignore the implications of it. Therefore, the …

This paper surveys the field of cooperative constraint solving for a constraint programming
perspective with an emphasis on combinations of symbolic and interval methods. On the …

As a case study that illustrates our view on coordination and component-based software
engineering, we present the design and implementation of a parallel constraint solver. The …

In constraint programming the Alldifferent constraint is one of the oldest and most used
global constraints. The algorithm by Régin enforces generalized arc-consistency, which is …

A constraint satisfaction problem (eg, a system of equations and inequalities) consists of a
finite set of constraints specifying which value combinations from given variable domains are …

Constraint propagation is a general algorithmic approach for pruning the search space of a
constraint satisfaction problem. In a uniform way, KR Apt [1] has defined computation as an …