Triple
T4765303
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Temporal Logic of Actions |
E105794
|
entity |
| Predicate | firstDescribedIn |
P519
|
FINISHED |
| Object | "The Temporal Logic of Actions" |
E105794
|
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: "The Temporal Logic of Actions" | Statement: [Temporal Logic of Actions, firstDescribedIn, "The Temporal Logic of Actions"]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: "The Temporal Logic of Actions" Context triple: [Temporal Logic of Actions, firstDescribedIn, "The Temporal Logic of Actions"]
-
A.
Temporal Logic of Actions
chosen
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.
-
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.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
D.
Semantical Considerations on Modal Logic
Semantical Considerations on Modal Logic is a landmark philosophical paper by Saul Kripke that helped found possible-worlds semantics and revolutionized the study of modal logic.
-
E.
“A Logic for Semantic Information”
“A Logic for Semantic Information” is a scholarly work that develops a formal logical framework for representing and reasoning about semantic information.
- 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.