دانلود کتاب Constraint Networks: Techniques and Algorithms

A major challenge in constraint programming is to develop efficient generic approaches to solve instances of the constraint satisfaction problem (CSP). With this aim in mind, this book provides an accessible synthesis of the author's research and work in this area, divided into four main topics: representation, inference, search, and learning. The results obtained and reproduced in this book have a wide applicability, regardless of the nature of the problem or the constraints involved, making it an extremely user-friendly resource for those involved in this field.Content: Chapter 1 Constraint Networks (pages 39–91): Chapter 2 Random and Structured Networks (pages 93–131): Chapter 3 Consistencies (pages 137–184): Chapter 4 Generic GAC Algorithms (pages 185–237): Chapter 5 Generalized Arc Consistency for Table Constraints (pages 239–286): Chapter 6 Singleton Arc Consistency (pages 287–317): Chapter 7 Path and Dual Consistency (pages 319–354): Chapter 8 Backtrack Search (pages 359–390): Chapter 9 Guiding Search toward Conflicts (pages 391–430): Chapter 10 Restarts and Nogood Recording (pages 431–458): Chapter 11 State?based Reasoning (pages 459–494): Chapter 12 Symmetry Breaking (pages 495–530): Christophe Lecoutre and Sebastien TabaryChapter A Mathematical Background (pages 531–539): Chapter B XML Representation of Constraint Networks (pages 541–545):