Constraint Satisfaction Problems (CSP) continues to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real life problems. That is why they are the subject of intense research in both artificial intelligence and operations research. This book introduces the classic CSP and details several extensions/improvements of both formalisms and techniques in order to tackle a large variety of problems. Indeed; consistency, flexible, dynamic, distributed, and learning aspects are dealt with and illustrated by simple examples such as the n-queen problem.
This book addresses the engineer, the teacher as well as the researcher novice or confirmed: the engineer by facilitating him the access to this domain, the researcher by providing him a vast bibliography and the teacher by supplying him a course support.
Keywords: General & Introductory Mathematics