LT
E874571
LT is the abbreviated name for the Logic Theorist, an early computer program that pioneered automated theorem proving in mathematical logic.
Statements (37)
| Predicate | Object |
|---|---|
| instanceOf |
automated theorem prover
ⓘ
computer program ⓘ |
| abbreviationOf | Logic Theorist NERFINISHED ⓘ |
| alsoKnownAs | Logic Theorist program NERFINISHED ⓘ |
| approach |
heuristic search
ⓘ
means-ends analysis ⓘ |
| approximateCreationYear |
1955
ⓘ
1956 ⓘ |
| basedOn | symbolic logic ⓘ |
| category |
history of artificial intelligence
ⓘ
history of computer science ⓘ |
| countryOfOrigin |
United States of America
ⓘ
surface form:
United States
|
| demonstratedAt | Dartmouth Summer Research Project on Artificial Intelligence NERFINISHED ⓘ |
| developedBy |
Allen Newell
NERFINISHED
ⓘ
Herbert A. Simon NERFINISHED ⓘ J. C. Shaw NERFINISHED ⓘ |
| developerAffiliation | RAND Corporation NERFINISHED ⓘ |
| domain | propositional logic ⓘ |
| field |
artificial intelligence
ⓘ
automated reasoning ⓘ mathematical logic ⓘ |
| fullName | Logic Theorist NERFINISHED ⓘ |
| historicalSignificance |
early milestone in cognitive simulation
ⓘ
first program to prove non-trivial theorems in symbolic logic ⓘ |
| influenced |
research in cognitive psychology of problem solving
ⓘ
subsequent automated theorem provers ⓘ |
| inspiredBy | human problem solving strategies ⓘ |
| language | list-processing language ⓘ |
| notableFor |
being one of the first programs in artificial intelligence
ⓘ
pioneering automated theorem proving ⓘ proving theorems from Principia Mathematica ⓘ |
| organization | RAND Corporation NERFINISHED ⓘ |
| provedFrom | Principia Mathematica by Whitehead and Russell NERFINISHED ⓘ |
| purpose | automated theorem proving ⓘ |
| relatedTo | General Problem Solver NERFINISHED ⓘ |
| timePeriod | mid-1950s ⓘ |
| usedAsExampleIn | early AI literature ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Logic Theorist