Triple
T2455505
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Human Problem Solving |
E54409
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | General Problem Solver |
E267834
|
NE FINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: General Problem Solver | Statement: [Human Problem Solving, relatedTo, General Problem Solver]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: General Problem Solver Context triple: [Human Problem Solving, relatedTo, General Problem Solver]
-
A.
General Problem Solver
chosen
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.
-
B.
Human Problem Solving
"Human Problem Solving" is a seminal 1972 book by Allen Newell and Herbert A. Simon that presents a foundational cognitive science and artificial intelligence theory of how humans represent and solve complex problems.
-
C.
"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.
-
D.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
E.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69ab49dee84c819096b50a0049c347ac |
completed | March 6, 2026, 9:40 p.m. |
| NER | Named-entity recognition | batch_69abd105054c819081286729749a347c |
completed | March 7, 2026, 7:17 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69af17932530819097caefff366e2183 |
completed | March 9, 2026, 6:55 p.m. |
Created at: March 6, 2026, 9:44 p.m.