Khaled Ghedira eBooks

A Constraint Satisfaction Problem (CSP) consists of a set ofvariables, a domain of values for each variable and a set ofconstraints. The objective is to assign a value for each variablesuch that all constraints are satisfied. CSPs continue to receiveincreased attention because of both their high complexity and theiromnipresence in academic, industrial and even reallife problems.This is why they are the subject of intense research in bothartificial intelligence and operations research. This bookintroduces the classic CSP and details severalextensions/improvements of both formalisms and techniques in orderto tackle a large variety of problems. Consistency, flexible,dynamic, distributed and learning aspects are discussed andillustrated using simple exam...