Triple
T3744694
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dijkstra |
E79781
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | weakest precondition |
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: weakest precondition | Statement: [Dijkstra, notableConcept, weakest precondition]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: weakest precondition Context triple: [Dijkstra, notableConcept, weakest precondition]
-
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.
Löb's theorem
Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
-
D.
Herbrand disjunction
Herbrand disjunction is a logical formula formed as a finite disjunction of ground instances of a first-order formula, central to Herbrand’s theorem in proof theory and automated reasoning.
-
E.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
- 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_69ad8b115610819095b02007da5ca3cb |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69adcb58c9048190a055d1f4a7e6b699 |
completed | March 8, 2026, 7:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b4db29b2288190932923a6bf1a7e8e |
completed | March 14, 2026, 3:51 a.m. |
Created at: March 8, 2026, 3:34 p.m.