Foundations of Constraint Satisfaction
This textbook examines the constraint satisfaction problem (CSP), which is a general problem in AI applications. It aims to provide a comprehensive introduction to the CSP, covering theoretical, practical and implementation issues. The book discusses formal definitions, CSP solving algorithms and implementation of some of the algorithms on PROLOG. The main objective of this book is to identify the properties of CSPs and introduce algorithms for tackling CSP. Its main feature is the fact that it presents the knowledge in CSP-solving in one volume.
- Hardback | 300 pages
- 160.02 x 236.22 x 30.48mm | 748.42g
- 01 Aug 1993
- Elsevier Science Publishing Co Inc
- Academic Press Inc
- San Diego, United States
Table of contents
Introduction to the CSP; CSP solving - an overview chapter; fundamental concepts of the CSP chapter; problem reduction chapter; basic search strategies for solving CSPs; search orders in searching in CSPs; exploitation of problem specific features; stochastic search methods for CSPs; solution synthesis; optimization in CSPs.