The DOI matches its Crossref record.
Empirical explorations of the logic theory machine: a case study in heuristic
Abstract
This paper is a case study in problem solving, representing part of a program of research on complex information-processing systems. We have specified a system for finding proofs of theorems in elementary symbolic logic, and by programming a computer to these specifications, have obtained empirical data on the problem-solving process in elementary logic. The program is called the Logic Theory Machine (LT); it was devised to learn how it is possible to solve difficult problems such as proving mathematical theorems, discovering scientific laws from data, playing chess, or understanding the meaning of English prose.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
SOAR: An Architecture for General Intelligence
Laird, J. E., Newell, A., & Rosenbloom, P. S. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90050-6 · Cited by 2,535
Self-citationThelen, E., & Smith, L. B. (2007) · Handbook of Child Psychology · doi:10.1002/9780470147658.chpsy0106 · Cited by 729
Human problem solving: The state of the theory in 1970.
Simon, H. A., & Newell, A. (1971) · American Psychologist · doi:10.1037/h0030806 · Cited by 635
Self-citationAI TURNS FIFTY: REVISITING ITS ORIGINS
Cordeschi, R. (2007) · Applied Artificial Intelligence · doi:10.1080/08839510701252304 · Cited by 108
Metadata
- Authors
- Newell, A., Shaw, J. C., & Simon, H. A.
- Venue
- Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability on - IRE-AIEE-ACM '57 (Western)
- Publisher
- ACM Press
- Published
- 1957
- Pages
- 218-230
- OpenAlex
- W2112161977
- Cited by
- 236
- References
- 0
- FWCI
- 2.36
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Empirical explorations of the logic theory machine: a case study in heuristic. https://app.cochat.ai/papers/10.1145/1455567.1455605
- The paper
- Newell, A., Shaw, J. C., & Simon, H. A. (1957). Empirical explorations of the logic theory machine: a case study in heuristic. Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability on - IRE-AIEE-ACM '57 (Western). https://doi.org/10.1145/1455567.1455605
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
