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 …

Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-
oriented customization of constraint systems. CHR are a declarative language extension …

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 …

This paper is an attempt to address the processing of non-linear numerical constraints over
the Reals by combining three different methods: local consistency techniques, symbolic …

This paper discusses the processing of non-linear polynomial systems using a branch and
prune algorithm within the framework of constraint programming. We propose a formalism …

In order to deal with constraint solvers integration, re-usability, and cooperation, we have
designed a domain independent environment for constraint solver collaboration (ie, solver …

In this paper we argue for an alternative way of designing cooperative constraint solver
systems using a control-oriented coordination language. The idea is to take advantage of …

Constraint programming is a paradigm based on the notion of constraints and mechanisms
for their resolution. Thus, the key point of this class of languages is not only to offer a wide …

Cette these est consacree au calcul de solutions numeriques (resolution) de systemes de
formules arithmetiques non-lineaires sur les reels (contraintes), au moyen de contraintes …