Before using interval analysis as a basic tool in the following chapters, we shall now
introduce its main concepts. Section 2.2 recalls fundamental notions on set operators, set …

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

This seminal text of Computer Science, the most cited book on the subject, is now available
for the first time in paperback. Constraint satisfaction is a decision problem that involves …

A large number of problems in AI and other areas of computer science can be viewed as
special cases of the constraint-satisfaction problem. Some examples are machine vision …

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 …

We introduce a general framework for constraint satisfaction and optimization where
classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can …

Many combinatorial search problems can be expressed as “constraint satisfaction problems”
and this class of problems is known to be NP-complete in general. In this paper, we …

Publisher Summary This chapter discusses that constraint reasoning involves various types
of techniques to tackle the inherent intractability of the problem of satisfying a set of …

In this paper we describe and compare two frameworks for constraint solving where
classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can …

Although the constraint satisfaction problem is NP-complete in general, a number of
constraint classes have been identified for which some fixed level of local consistency is …