Constraint Satisfaction Problems: CSP Formalisms and Techniques (repost)
Constraint Satisfaction Problems: CSP Formalisms and Techniques
by Khaled Ghedira
English | 2013 | ISBN: 184821460X | 240 pages | PDF | 2.73 MB
by Khaled Ghedira
English | 2013 | ISBN: 184821460X | 240 pages | PDF | 2.73 MB
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.
Please No mirrors.