Triple

T6816319
Position Surface form Disambiguated ID Type / Status
Subject Robert S. Boyer E156763 entity
Predicate notableWork P4 FINISHED
Object A Computational Logic
A Computational Logic is a foundational book in computer science that introduced a rigorous framework for automated theorem proving and formal reasoning about programs.
E524533 NE FINISHED

How this triple was built (4 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: A Computational Logic | Statement: [Robert S. Boyer, notableWork, A Computational Logic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: A Computational Logic
Context triple: [Robert S. Boyer, notableWork, A Computational Logic]
  • A. 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.
  • B. Logical Methods in Computer Science
    Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
  • C. "Logic for Computer Science: Foundations of Automatic Theorem Proving"
    "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
  • D. First-Order Logic and Automated Theorem Proving
    "First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
  • E. The Calculus of Computation
    The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: A Computational Logic
Triple: [Robert S. Boyer, notableWork, A Computational Logic]
Generated description
A Computational Logic is a foundational book in computer science that introduced a rigorous framework for automated theorem proving and formal reasoning about programs.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: A Computational Logic
Target entity description: A Computational Logic is a foundational book in computer science that introduced a rigorous framework for automated theorem proving and formal reasoning about programs.
  • A. 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.
  • B. Logical Methods in Computer Science
    Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
  • C. "Logic for Computer Science: Foundations of Automatic Theorem Proving" chosen
    "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
  • D. First-Order Logic and Automated Theorem Proving
    "First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
  • E. The Calculus of Computation
    The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
  • F. None of above.

Provenance (5 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_69c68828b26c819090fe9df7612bbc27 completed March 27, 2026, 1:37 p.m.
NER Named-entity recognition batch_69c6d32dc19c8190a871cc1ff1471a58 completed March 27, 2026, 6:57 p.m.
NED1 Entity disambiguation (via context triple) batch_69c723e0c62c8190b3b3b092ea48d4c5 completed March 28, 2026, 12:42 a.m.
NEDg Description generation batch_69c7247806808190ac60c134cec612c8 completed March 28, 2026, 12:44 a.m.
NED2 Entity disambiguation (via description) batch_69c72536c4808190b9012e282cf02da4 completed March 28, 2026, 12:47 a.m.
Created at: March 27, 2026, 2:17 p.m.