Principles of constraint programming

Krzysztof R. Apt

420 pages, parution le 22/10/2003

Ajouter à une liste

Indisponible

Résumé

Constraints are everywhere: most computational problems can be described in terms of restrictions imposed on the set of possible solutions, and constraint programming is a problem-solving technique that works by incorporating those restrictions in a programming environment. It draws on methods from combinatorial optimization and artificial intelligence, and has been successfully applied in a number of fields from scheduling, computational biology, finance, electrical engineering and operations research through to numerical analysis.

This textbook for upper-division students provides a thorough and structured account of the main aspects of constraint programming. The author provides many worked examples that illustrate the usefulness and versatility of this approach to programming, as well as many exercises throughout the book that illustrate techniques, test skills and extend the text. Pointers to current research, extensive historical and bibliographic notes, and a comprehensive list of references will also be valuable to professionals in computer science and artificial intelligence.

Introduction
Constraint satisfaction problems: Examples
Constraint programming in a nutshell
Some complete constraint solvers
Local consistency notions
Some incomplete constraint solvers
Constraint propagation algorithms
Search
Issues in constraint programming
Bibliogrpahy
Author index
Subject index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Cambridge University Press
Auteur(s)	Krzysztof R. Apt
Parution	22/10/2003
Nb. de pages	420
Format	17,7 x 25,3
Couverture	Relié
Poids	970g
Intérieur	Noir et Blanc
EAN13	9780521825832
ISBN13	978-0-521-82583-2