Triple

T846542
Position Surface form Disambiguated ID Type / Status
Subject Tony Hoare E18287 entity
Predicate notableWork P4 FINISHED
Object Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
E100208 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: Hoare logic | Statement: [Tony Hoare, notableWork, Hoare logic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hoare logic
Context triple: [Tony Hoare, notableWork, Hoare logic]
  • A. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • B. 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.
  • C. Knuth–Bendix completion algorithm
    The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
  • D. Science of Logic
    Science of Logic is a foundational philosophical work by G.W.F. Hegel that systematically develops his dialectical method and metaphysical account of concepts, being, and reality.
  • E. CSP (Communicating Sequential Processes)
    CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
  • 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: Hoare logic
Triple: [Tony Hoare, notableWork, Hoare logic]
Generated description
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hoare logic
Target entity description: Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
  • A. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • B. 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.
  • C. Knuth–Bendix completion algorithm
    The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
  • D. Science of Logic
    Science of Logic is a foundational philosophical work by G.W.F. Hegel that systematically develops his dialectical method and metaphysical account of concepts, being, and reality.
  • E. CSP (Communicating Sequential Processes)
    CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
  • F. None of above. chosen

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_69a4938b04208190b82e1df6b572c548 completed March 1, 2026, 7:29 p.m.
NER Named-entity recognition batch_69a4ac0ba6b4819089c15ed7e1765502 completed March 1, 2026, 9:13 p.m.
NED1 Entity disambiguation (via context triple) batch_69a7929e65d08190bcea03f581288cc4 completed March 4, 2026, 2:02 a.m.
NEDg Description generation batch_69a7937c2ce481908c04e08e2be02985 completed March 4, 2026, 2:05 a.m.
NED2 Entity disambiguation (via description) batch_69a79761ee34819094a0558ef195d8a0 completed March 4, 2026, 2:22 a.m.
Created at: March 1, 2026, 7:38 p.m.