Triple
T15860731
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CTL* |
E384578
|
entity |
| Predicate | expressivenessRelation |
P74558
|
FINISHED |
| Object | CTL* is strictly more expressive than both CTL and LTL |
E384578
|
NE FINISHED |
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: CTL* is strictly more expressive than both CTL and LTL | Statement: [CTL*, expressivenessRelation, CTL* is strictly more expressive than both CTL and LTL]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: CTL* is strictly more expressive than both CTL and LTL Context triple: [CTL*, expressivenessRelation, CTL* is strictly more expressive than both CTL and LTL]
-
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.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: expressivenessRelation Context triple: [CTL*, expressivenessRelation, CTL* is strictly more expressive than both CTL and LTL]
-
A.
expressivenessComparedTo
Indicates a comparison of how expressive one entity is relative to another in conveying meaning, emotion, or nuance.
-
B.
hasExpressivity
Indicates that one entity possesses a certain level or type of expressive power, capability, or richness in representation relative to another.
-
C.
expressivePower
chosen
Indicates the degree to which one system, language, or formalism can represent or capture the behaviors, structures, or concepts expressible in another.
-
D.
moreExpressiveThan
Indicates that one entity conveys ideas, emotions, or information with greater richness, nuance, or clarity than another.
-
E.
expressiveQuality
Indicates the distinctive emotional or stylistic character conveyed by something, such as how it feels, sounds, or appears in an expressive sense.
- F. None of above.
Provenance (4 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_69e174de2cd48190ab18e48c9f051a2a |
completed | April 16, 2026, 11:46 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ffa14da7ac8190bbef49a1602a76fe |
completed | May 9, 2026, 9:04 p.m. |
| PD | Predicate disambiguation | batch_69e142b976c081908d3ba3e705419f3a |
completed | April 16, 2026, 8:12 p.m. |
Created at: April 10, 2026, 4:50 a.m.