Triple
T4596170
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hoare logic |
E100208
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Floyd–Hoare logic
Floyd–Hoare logic is a formal system for reasoning about the partial and total correctness of computer programs using 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: Floyd–Hoare logic | Statement: [Hoare logic, relatedTo, Floyd–Hoare logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Floyd–Hoare logic Context triple: [Hoare logic, relatedTo, Floyd–Hoare logic]
-
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.
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.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
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.
-
E.
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.
- 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: Floyd–Hoare logic Triple: [Hoare logic, relatedTo, Floyd–Hoare logic]
Generated description
Floyd–Hoare logic is a formal system for reasoning about the partial and total correctness of computer programs using assertions about program states.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Floyd–Hoare logic Target entity description: Floyd–Hoare logic is a formal system for reasoning about the partial and total correctness of computer programs using assertions about program states.
-
A.
Hoare logic
chosen
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.
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.
-
C.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
D.
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.
-
E.
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.
- 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_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.