Triple

T11311054
Position Surface form Disambiguated ID Type / Status
Subject General Problem Solver E267834 entity
Predicate influencedBy P9 FINISHED
Object Logic Theorist E275782 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: Logic Theorist | Statement: [General Problem Solver, influencedBy, Logic Theorist]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Logic Theorist
Context triple: [General Problem Solver, influencedBy, Logic Theorist]
  • A. the Logic Theorist program chosen
    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.
  • B. "The Complexity of Theorem-Proving Procedures"
    "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
  • C. A Computing Procedure for Quantification Theory
    "A Computing Procedure for Quantification Theory" is a seminal 1960 paper by Martin Davis and Hilary Putnam that introduced the Davis–Putnam algorithm, laying foundational work for automated theorem proving and propositional satisfiability.
  • D. "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.
  • E. 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.
  • 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_69d6aaca5c24819083db46a30d86cb34 completed April 8, 2026, 7:21 p.m.
NER Named-entity recognition batch_69d7e9c0b3b88190ac0e3d6a5ad3b9bc completed April 9, 2026, 6:02 p.m.
NED1 Entity disambiguation (via context triple) batch_69e50a7fc06881909afe85a600d25ff2 completed April 19, 2026, 5:01 p.m.
Created at: April 8, 2026, 9:32 p.m.