Triple
T10304218
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Model Checking |
E241708
|
entity |
| Predicate | topic |
P261
|
FINISHED |
| Object | mu-calculus |
E824073
|
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: mu-calculus | Statement: [Model Checking, topic, mu-calculus]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: mu-calculus Context triple: [Model Checking, topic, mu-calculus]
-
A.
mu-calculus
chosen
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.
-
B.
branching-time temporal logic CTL*
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.
-
C.
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.
-
D.
Kleene algebra
Kleene algebra is an algebraic structure used to model and reason about regular expressions, program control flow, and formal languages through operations like choice, sequencing, and iteration.
-
E.
π-calculus
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
- 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_69d381ac38808190a8ca7457c85b625b |
completed | April 6, 2026, 9:49 a.m. |
| NER | Named-entity recognition | batch_69d4d308f034819098da69b963eb8a02 |
completed | April 7, 2026, 9:48 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d71d58416081909a010e905d70e934 |
completed | April 9, 2026, 3:30 a.m. |
Created at: April 6, 2026, 11:45 a.m.