Foundations of Constraint Satisfaction. Computation in Cognitive Science

✍ Scribed by Edward Tsang (Auth.)

• Publisher: Elsevier Ltd, Academic Press
• Year: 1993
• Tongue: English
• Leaves: 427
• Series: Computation in Cognitive Science
• Category: Library

✦ Synopsis

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

✦ Table of Contents

Content:
Computation in Cognitive Science, Page ii
Front Matter, Page iii
Copyright, Page iv
Series Preface, Page v
Dedication, Page vi
Preface, Pages vii-viii
Acknowledgements, Page ix
Notations and abbreviations, Pages xvii-xviii
Chapter 1 - Introduction, Pages 1-30
Chapter 2 - CSP solving — An overview, Pages 31-52
Chapter 3 - Fundamental concepts in the CSP, Pages 53-78
Chapter 4 - Problem reduction, Pages 79-118
Chapter 5 - Basic search strategies for solving CSPs, Pages 119-156
Chapter 6 - Search orders in CSPs, Pages 157-188
Chapter 7 - Exploitation of problem-specific features, Pages 189-251
Chapter 8 - Stochastic search methods for CSPs, Pages 253-270
Chapter 9 - Solution synthesis, Pages 271-298
Chapter 10 - Optimization in CSPs, Pages 299-319
Programs, Pages 321,323-382
Bibliography, Pages 383-403
Index, Pages 405-421