Constraint satisfaction is a general problem in which the goal
is to find values for a set of variables that will satisfy a
given set of constraints. It is the core of many applications
in artificial intelligence, and has found its application in
many areas, such as planning and scheduling. Because of its generality,
most AI researchers should be able to benefit from having
good knowledge of techniques in this field.
Published in 1993, this book was the first attempt to define the field of constraint satisfaction. It covers both the theoretical and the implementation aspects of the subject. It provides a framework for studying this field, relates different research, and resolves ambiguity in a number of concepts and algorithms in the literature.
This book is arguably the most rigorous book in the field.
All major concepts were defined in First Order Predicate Calculus (FOPC).
Concepts defined this way are precise and unambiguous.
|
This book was published by Academic Press:
It is now out of print. |
|
|
You may download the chapters from the links above.
If you want a hard copy, reprints in ring binders are available from:
|
|
Note that to save printing cost, the program part, pages 321 to 382, have not been included in the re-print. They are available by ftp:
Payments should be made in Pound Sterling. If you are paying by foreign currency, please add the equivalence of 6 Pounds to cover bank charges.
The University accepts payments by credit cards.
|
|
|
 |
BRACIL Home Page |