Triple
T11016224
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | The Logic of Computer Programming |
E260371
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Hoare logic |
E100208
|
NE FINISHED |
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 logic | Statement: [The Logic of Computer Programming, relatedConcept, Hoare logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hoare logic Context triple: [The Logic of Computer Programming, relatedConcept, Hoare logic]
-
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.
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.
-
C.
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.
-
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 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.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d6aa9687448190b28d353b1b6a610e |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d797a558a08190bdb5779faa9adf05 |
completed | April 9, 2026, 12:12 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e374d371ec8190aba9e77346c6e876 |
completed | April 18, 2026, 12:10 p.m. |
Created at: April 8, 2026, 9:25 p.m.