Classic AI: search, logic & planning· 1977
Consistency in networks of relations
On the reading lists
- #206 in the Top 500 (2026 edition)
- #8 in Classic AI: search, logic & planning (2026 edition)
Why it matters
Systematized local consistency methods, foundational to constraint satisfaction algorithms.
Condensed from the expert lists' notes.
The record
- First released
- 1977 (from OpenAlex)
- Citations
- 2,960 citations, as counted by
Semantic Scholar (non-commercial licence) - Named by
- both expert lists
- Score
- 0.531 · computed rank 206 · consensus 0.63, must-read 0.5, citations percentile 0.833 (1970s · classic-ai), awards 0, existing lists 0. Method
Editor's notes
- Readability check: pass: Arc consistency, the core of constraint satisfaction. (AI draft (Claude), not yet reviewed, 2026-10-29)
Data sources
Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0), and
Semantic Scholar (used under its non-commercial API licence). Each count names its source. See the method.