We show that several constraint propagation algorithms (also called (local) consistency,
consistency enforcing, Waltz, filtering or narrowing algorithms) are instances of algorithms …

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 …

We provide here a simple, yet very general framework that allows us to explain several
constraint propagation algorithms in a systematic way. In particular, using the notions …

Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks
ranging from resource allocation and scheduling to configuration and design. Increasingly …

Motivated by the pitfalls of collaborative problem solving in [121],[123], solution quality and
communication efficiency, in this chapter [113],[117] we set forth some important …

Constraint programming is an alternative approach to programming in which the
programming process is limited to a generation of requirements (constraints) and a solution …

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 …

An efficient parallel interval narrowing algorithm for solving numerical problems is designed,
implemented and tested. Differences with the corresponding sequential algorithm are clearly …

Constraing propagation algorithms form an important part of most of the constraint
programming systems. We provide here a simple, yet very general framework that allows us …

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 …