Overview
A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real-life problems. This 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. Consistency, flexible, dynamic, distributed and learning aspects are discussed and illustrated using simple examples such as the n-queen problem.
The book, Constraint Satisfaction Problems: CSP Formalisms and Techniques [Bulk, Wholesale, Quantity] ISBN#9781848214606 in Hardcover by Khaled Ghedira may be ordered in bulk quantities. Minimum starts at 25 copies. Availability based on publisher status and quantity being ordered.
Details
