Triple
T15860750
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CTL* |
E384579
|
entity |
| Predicate | hasFullName |
P16
|
FINISHED |
| Object | Computation Tree Logic star |
E384578
|
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: Computation Tree Logic star | Statement: [CTL*, hasFullName, Computation Tree Logic star]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Computation Tree Logic star Context triple: [CTL*, hasFullName, Computation Tree Logic star]
-
A.
branching-time temporal logic CTL*
chosen
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
-
B.
linear temporal logic
Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
-
C.
The Temporal Logic of Programs
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
D.
mu-calculus
The mu-calculus is a powerful modal logic with fixed-point operators used to express and verify properties of recursive and infinite-state systems in computer science.
-
E.
Compositional model checking
Compositional model checking is a formal verification technique that proves system correctness by analyzing components separately and then combining the results, enabling scalable verification of complex 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_69d86da422088190aac39e32e6c68429 |
completed | April 10, 2026, 3:25 a.m. |
| NER | Named-entity recognition | batch_69e1555b952481909246f5ebf53df2a9 |
completed | April 16, 2026, 9:32 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ffa941a0a481909c8d8e98861b46d6 |
completed | May 9, 2026, 9:38 p.m. |
Created at: April 10, 2026, 4:50 a.m.