Triple
T17674764
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Spec# |
E440617
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object | Dafny programming language |
—
|
NE NERFINISHED |
How this triple was built (3 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: Dafny programming language | Statement: [Spec#, influenced, Dafny programming language]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dafny programming language Context triple: [Spec#, influenced, Dafny programming language]
-
A.
TLA+
TLA+ is a formal specification language developed by Leslie Lamport for modeling and verifying concurrent and distributed systems using mathematical logic.
-
B.
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.
-
C.
Eiffel programming language
Eiffel is an object-oriented programming language designed by Bertrand Meyer that emphasizes software correctness through features like Design by Contract and strong support for modular, reusable code.
-
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.
Domain-Specific Languages
Domain-Specific Languages is a technical book by Martin Fowler that explores the design, implementation, and practical use of specialized programming languages tailored to specific problem domains.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Dafny programming language Target entity description: Dafny is a verification-aware programming language and toolchain designed to support formal specification, automated proof of correctness, and executable code generation for imperative and functional programs.
-
A.
TLA+
TLA+ is a formal specification language developed by Leslie Lamport for modeling and verifying concurrent and distributed systems using mathematical logic.
-
B.
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.
-
C.
Eiffel programming language
Eiffel is an object-oriented programming language designed by Bertrand Meyer that emphasizes software correctness through features like Design by Contract and strong support for modular, reusable code.
-
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.
Domain-Specific Languages
Domain-Specific Languages is a technical book by Martin Fowler that explores the design, implementation, and practical use of specialized programming languages tailored to specific problem domains.
- F. None of above. chosen
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_69d8b9e87e18819087104a44dc4dc5b1 |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e46f6ba22081909e2099490c047378 |
completed | April 19, 2026, 6 a.m. |
Created at: April 10, 2026, 10 a.m.