Triple
T4765317
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Temporal Logic of Actions |
E105794
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object | PlusCal |
E467808
|
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: PlusCal | Statement: [Temporal Logic of Actions, influenced, PlusCal]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: PlusCal Context triple: [Temporal Logic of Actions, influenced, PlusCal]
-
A.
PlusCal algorithm language
chosen
PlusCal algorithm language is a high-level pseudocode-style language designed by Leslie Lamport for writing and reasoning about algorithms that can be automatically translated into TLA+ specifications.
-
B.
TLA+
TLA+ is a formal specification language developed by Leslie Lamport for modeling and verifying concurrent and distributed systems using mathematical logic.
-
C.
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.
-
D.
CCS (Calculus of Communicating Systems)
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
-
E.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
- 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_69bd43f226fc8190b867cc249c2a9042 |
completed | March 20, 2026, 12:56 p.m. |
| NER | Named-entity recognition | batch_69bd65327af48190881c25763232c368 |
completed | March 20, 2026, 3:18 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69be43bad99c8190a170baefea057038 |
completed | March 21, 2026, 7:07 a.m. |
Created at: March 20, 2026, 1:21 p.m.