Constraint Satisfaction Problems
CSP Formalisms and Techniques
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 real-life 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 examples such as the n-queen problem.
1. Foundations of CSP.
2. Consistency Reinforcement Techniques.
3. CSP Solving Algorithms.
4. Search Heuristics.
5. Learning Techniques.
6. Maximal Constraint Satisfaction Problems.
7. Constraint Satisfaction and Optimization Problems.
8. Distibuted Constraint Satisfaction Problems.
About the Authors
Khaled Ghedira is the general managing director of the TunisScience City in Tunisia, Professor at the University of Tunis, aswell as the founding president of the Tunisian Association ofArtificial Intelligence and the founding director of the SOIEresearch laboratory. His research areas include MAS, CSP, transportand production logistics, metaheuristics and security inM/E-government. He has led several national and internationalresearch projects, supervised 30 PhD theses and more than 50Master’s theses, co-authored about 300 journal, conferenceand book research papers, written two text books on metaheuristicsand production logistics and co-authored three others.
, or download in or
Title: Constraint Satisfaction Problems
Author: Khaled Ghedira
A Gentle Introduction to Optimization 2014 US$ 32.00 284 pages
Alan M. Turing 2012 US$ 13.00 210 pages