Triple
T4765321
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Temporal Logic of Actions |
E105794
|
entity |
| Predicate | comparedWith |
P278
|
FINISHED |
| Object | computation tree logic |
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 | Statement: [Temporal Logic of Actions, comparedWith, computation tree logic]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: computation tree logic Context triple: [Temporal Logic of Actions, comparedWith, computation tree logic]
-
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.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
C.
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.
-
D.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
E.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
- 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_69be3a87741081909380c51ba4efed92 |
completed | March 21, 2026, 6:28 a.m. |
Created at: March 20, 2026, 1:21 p.m.