Triple
T18791273
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | An Axiomatic Basis for Computer Programming |
E459518
|
entity |
| Predicate | usesNotation |
P6184
|
FINISHED |
| Object | Hoare triple |
—
|
NE NERFINISHED |
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: Hoare triple | Statement: [An Axiomatic Basis for Computer Programming, usesNotation, Hoare triple]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hoare triple Context triple: [An Axiomatic Basis for Computer Programming, usesNotation, Hoare triple]
-
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.
Hoare
Hoare is the surname of a prominent British family historically associated with politics, banking, and public service.
-
C.
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.
-
D.
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.
-
E.
Böhm–Jacopini theorem
The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8d396f54c8190ba49db31e8743842 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e5978665388190aaefed0ec30a1ff3 |
completed | April 20, 2026, 3:03 a.m. |
Created at: April 10, 2026, 11:53 a.m.