Constraint Networks: Techniques and Algorithms (Hardcover)

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.

在約束編程中的一個主要挑戰是開發高效的通用方法來解決約束滿足問題（CSP）的實例。為了達到這個目的，本書提供了作者在這個領域的研究和工作的易於理解的綜合，分為四個主要主題：表示、推理、搜索和學習。本書中獲得並重現的結果具有廣泛的應用性，無論問題的性質或所涉及的約束如何，都使其成為這個領域的從業人員非常友好的資源。