Classic AI: search, logic & planning· 1991
Temporal Constraint Networks
On the reading lists
- #31 in Classic AI: search, logic & planning (2026 edition)
Why it matters
Temporal reasoning via constraint networks.
Condensed from the expert lists' notes.
The record
- First released
- 1991 (from Crossref)
- Citations
- 2,252 citations, as counted by
Semantic Scholar (non-commercial licence) - Named by
- the grok list only
- Score
- 0.323 · computed rank 549 · consensus 0.17, must-read 0, citations percentile 0.778 (1990s · classic-ai), awards 0, existing lists 0. Method
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.