DeepRead
Cover of Constraint Processing

Constraint Processing

Rina Dechter · 2003

Programming and computer science › Lisp and Scheme

#13,267 most recommended

About the book

A textbook on constraint satisfaction and constraint networks, the formalism in which a problem is stated as variables, domains, and constraints among them. It covers the core algorithms for deciding and solving such problems, including consistency enforcement, backtracking search, and graph-based methods, and it is aimed at students and researchers in artificial intelligence and computer science. Many problems in planning, scheduling, vision, and configuration can be expressed in the single constraint-network framework, so techniques developed for it transfer across domains. The book's central claim is that the cost of solving these problems depends largely on the structure of the constraint graph, so methods that exploit that structure, such as bucket elimination and tree decomposition, can be far more efficient than naive search. It also presents hybrids that combine search with inference as a practical middle ground.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

024201020122014201620172010 peak · 1
This bookAverage book in Lisp and Scheme

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 4 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2003
ISBN
9781558608900
Editions known
2 at Open Library
Open Library
OL25727147W

Constraint programming (computer science)

Explore in the mosaic

Read next: its neighbours on the mosaic