Classic AI: search, logic & planning· 1960
A Computing Procedure for Quantification Theory
On the reading lists
- #320 in the Top 500 (2026 edition)
- #15 in Classic AI: search, logic & planning (2026 edition)
Why it matters
Introduced Davis–Putnam reasoning techniques central to satisfiability solving.
Condensed from the expert lists' notes.
The record
- First released
- 1960 (from OpenAlex)
- Citations
- 3,095 citations, as counted by
Semantic Scholar (non-commercial licence) - Named by
- both expert lists
- Score
- 0.429 · computed rank 320 · consensus 0.7, must-read 0, citations percentile 0.625 (pre-1970 · 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.