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.
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.
Get Constraint Satisfaction Problems – CSP Formalisms and Techniques by Khaled Ghedira at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by ISTE Ltd and John Wiley & Sons Inc and it has 240 pages.
Our digital collection is currently being curated to ensure the best possible reading experience on Werezi. We'll be launching our Ebooks platform shortly.
Your privacy, your choice
Make Werezi work for you
We use essential cookies for your cart and sign-in. With your permission, optional cookies help us understand how Werezi is used and improve your book recommendations.
Essential cookies are always active. Optional analytics stay off unless you choose Allow all.