Triple

T4596171
Position Surface form Disambiguated ID Type / Status
Subject Hoare logic E100208 entity
Predicate relatedTo P37 FINISHED
Object Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
 E459519 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: Dijkstra weakest precondition calculus | Statement: [Hoare logic, relatedTo, Dijkstra weakest precondition calculus]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Dijkstra weakest precondition calculus
Context triple: [Hoare logic, relatedTo, Dijkstra weakest precondition calculus]
  • A. 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.
  • B. A Discipline of Programming
    A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
  • C. 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.
  • D. Boyer–Moore theorem prover
    The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
  • E. 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.
  • 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: Dijkstra weakest precondition calculus
Triple: [Hoare logic, relatedTo, Dijkstra weakest precondition calculus]
Generated description
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Dijkstra weakest precondition calculus
Target entity description: Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
  • A. 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.
  • B. A Discipline of Programming
    A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
  • C. 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.
  • D. Boyer–Moore theorem prover
    The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
  • E. 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.
  • 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_69bd43cbc014819098b45f435908f88a completed March 20, 2026, 12:55 p.m.
NER Named-entity recognition batch_69bd594055dc8190a50f1b4be2be1ba0 completed March 20, 2026, 2:27 p.m.
NED1 Entity disambiguation (via context triple) batch_69bdfa4552148190be200be028ef3fdd completed March 21, 2026, 1:54 a.m.
NEDg Description generation batch_69bdfb37b1448190a4001b9ed2b79012 completed March 21, 2026, 1:58 a.m.
NED2 Entity disambiguation (via description) batch_69bdfc0e456c81908efa3858d981ccc0 completed March 21, 2026, 2:01 a.m.
Created at: March 20, 2026, 1:11 p.m.