the Logic Theorist program
E275782
The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Logic Theorist | 2 |
| the Logic Theorist program canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2515735 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: the Logic Theorist program Context triple: [Allen Newell, knownFor, the Logic Theorist program]
-
A.
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence"
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence" is the seminal 1955 research proposal by John McCarthy and colleagues that launched the field of artificial intelligence by defining its goals and organizing the landmark 1956 Dartmouth conference.
-
B.
Computing Machinery and Intelligence
"Computing Machinery and Intelligence" is Alan Turing’s landmark 1950 paper that introduced the Turing Test and fundamentally shaped the philosophical and technical foundations of artificial intelligence.
-
C.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
D.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
E.
General Problem Solver
The General Problem Solver is an early artificial intelligence program designed to model and automate human-like problem-solving across a wide range of domains using general search and reasoning strategies.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: the Logic Theorist program Target entity description: The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
-
A.
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence"
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence" is the seminal 1955 research proposal by John McCarthy and colleagues that launched the field of artificial intelligence by defining its goals and organizing the landmark 1956 Dartmouth conference.
-
B.
Computing Machinery and Intelligence
"Computing Machinery and Intelligence" is Alan Turing’s landmark 1950 paper that introduced the Turing Test and fundamentally shaped the philosophical and technical foundations of artificial intelligence.
-
C.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
D.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
E.
General Problem Solver
The General Problem Solver is an early artificial intelligence program designed to model and automate human-like problem-solving across a wide range of domains using general search and reasoning strategies.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
artificial intelligence program
ⓘ
automated theorem prover ⓘ computer program ⓘ historical AI system ⓘ |
| alsoKnownAs | LT ⓘ |
| approach | search in a space of logical expressions ⓘ |
| basedOn |
heuristic search
ⓘ
means-ends analysis ⓘ symbolic reasoning ⓘ |
| countryOfOrigin |
United States of America
ⓘ
surface form:
United States
|
| demonstratedAt |
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence"
ⓘ
surface form:
Dartmouth Summer Research Project on Artificial Intelligence (indirectly via related work)
|
| describedIn | paper by Newell and Simon on heuristic problem solving ⓘ |
| designedFor |
proving theorems in Principia Mathematica
ⓘ
proving theorems in propositional logic ⓘ |
| developedAt |
Carnegie Technical Schools
ⓘ
surface form:
Carnegie Institute of Technology
RAND Corporation ⓘ |
| developedBy |
Allen Newell
ⓘ
Herbert Simon ⓘ
surface form:
Herbert A. Simon
J. C. Shaw ⓘ |
| developersRole |
Allen Newell
ⓘ
surface form:
Allen Newell was a principal designer
Herbert A. Simon contributed theoretical framework ⓘ J. C. Shaw implemented the program ⓘ |
| era | 1950s ⓘ |
| field |
artificial intelligence
ⓘ
cognitive science ⓘ symbolic logic ⓘ |
| firstDemonstrated | 1956 ⓘ |
| hardwareUsed | Johnniac computer ⓘ |
| historicalSignificance |
early demonstration of machine reasoning
ⓘ
landmark in the history of artificial intelligence ⓘ often regarded as the first AI program ⓘ |
| inception | 1955 ⓘ |
| influenced |
General Problem Solver
ⓘ
early cognitive psychology models ⓘ subsequent automated theorem provers ⓘ |
| inspiredBy | human problem solving in mathematics ⓘ |
| logicType | propositional logic ⓘ |
| notableAchievement |
found a more elegant proof of a theorem than the one in Principia Mathematica
ⓘ
proved 38 of the first 52 theorems in Principia Mathematica ⓘ |
| partOf | early AI research at RAND ⓘ |
| programmingLanguage | Information Processing Language ⓘ |
| relatedTo |
General Problem Solver
ⓘ
Information Processing Language ⓘ heuristic search methods ⓘ |
| uses |
goal-directed search
ⓘ
heuristic guidance ⓘ production-like rules ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: the Logic Theorist program Description of subject: The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Logic Theorist
this entity surface form:
Logic Theorist