UID:
almafu_9959327065402883
Format:
1 online resource (586 pages) :
,
illustrations
ISBN:
9780470611821
,
0470611820
,
9780470610381
,
0470610387
,
1282684086
,
9781282684089
Content:
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.
Note:
Constrant networks -- Random and structured networks -- Inference. Consistencies -- Generic GAC algorithms -- Generalized arc consistency for table constraints -- Singleton arc consistency -- Path and dual consistency -- Search. Backtrack search -- Guiding search toward conflicts -- Restarts and nogood recording -- State-based reasoning -- Symmetry breaking / Christophe Lecoutre, Sébastien Tabary -- Appendices. A. Mathematical background -- B. XML representation of constraint networks.
Additional Edition:
Print version: Lecoutre, Christophe. Constraint networks. London : ISTE ; Hoboken, NJ : John Wiley & Sons, 2009 ISBN 9781848211063
Language:
English
Keywords:
Electronic books.
;
Electronic books.
;
Electronic books.
DOI:
10.1002/9780470611821
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9780470611821
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9780470611821
URL:
https://onlinelibrary.wiley.com/doi/book/10.1002/9780470611821
