Constraint processing

Rina Dechter

502 pages, parution le 19/11/2003

Ajouter à une liste

Indisponible

Résumé

Features :

Builds the reader's understanding with definitions, examples, theory, algorithms and complexity analysis
Focuses on fundamental tools and principles
Synthesizes three decades of research in diverse fields including AI, databases, operations research, and management science.

Constraint reasoning has matured over the last three decades with contributions from a diverse community of researchers in artificial intelligence, databases and programming languages, operations research, management science, and applied mathematics. In Constraint Processing, Rina Dechter synthesizes these contributions, as well as her own significant work, to provide the first comprehensive examination of the theory that underlies constraint processing algorithms. Throughout she focuses on fundamental tools and principles, emphasizing the representation and analysis of algorithms.

Introduction
Basics of Constraint Processing
- Constraint Networks
- Consistency-Enforcing Algorithms: Constraint Propagation
- Directional Consistency
- General Search Strategies
- General Search Strategies: Look-Back
- Stochastic Greedy Local Search
Advanced Methods
- Advanced Consistency Methods
- Tree-Decomposition Methods
- Hybrids of Search and Inference: Time-Space Trade-offs
- Tractable Constraint Languages
- Temporal Constraint Networks
- Constraint Optimization
- Probabilistic Networks
- Constraint Logic Programming
Bibliography
Index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Morgan Kaufmann
Auteur(s)	Rina Dechter
Parution	19/11/2003
Nb. de pages	502
Format	19 x 24
Couverture	Relié
Poids	1065g
Intérieur	Noir et Blanc
EAN13	9781558608900
ISBN13	978-1-55860-890-0