Triple

T19111986
Position Surface form Disambiguated ID Type / Status
Subject linear temporal logic E467810 entity
Predicate isRelatedTo P37 FINISHED
Object Büchi automata — NE NERFINISHED

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: Büchi automata | Statement: [linear temporal logic, isRelatedTo, Büchi automata]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Büchi automata
Context triple: [linear temporal logic, isRelatedTo, Büchi automata]
  • A. Rabin–Scott powerset construction
    The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
  • B. Rabin automaton
    A Rabin automaton is a type of ω-automaton used in formal verification and automata theory to recognize sets of infinite sequences via Rabin acceptance conditions.
  • C. Finite Automata and Their Decision Problems
    "Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
  • D. Decision Problems in the Theory of Automata
    "Decision Problems in the Theory of Automata" is the doctoral thesis of computer scientist Amir Pnueli, focusing on foundational questions about the solvability and complexity of problems related to automata theory.
  • E. Automata and Computability (textbook)
    Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Büchi automata
Target entity description: Büchi automata are a type of ω-automaton used to recognize languages of infinite words, playing a central role in the automata-theoretic approach to model checking and the semantics of linear temporal logic.
  • A. Rabin–Scott powerset construction
    The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
  • B. Rabin automaton
    A Rabin automaton is a type of ω-automaton used in formal verification and automata theory to recognize sets of infinite sequences via Rabin acceptance conditions.
  • C. Finite Automata and Their Decision Problems
    "Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
  • D. Decision Problems in the Theory of Automata
    "Decision Problems in the Theory of Automata" is the doctoral thesis of computer scientist Amir Pnueli, focusing on foundational questions about the solvability and complexity of problems related to automata theory.
  • E. Automata and Computability (textbook)
    Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
  • F. None of above. chosen

Provenance (2 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_69d8dd06a26481908039e2a1bae8c597 completed April 10, 2026, 11:20 a.m.
NER Named-entity recognition batch_69e5e394969c81909d09b2300ea0e041 completed April 20, 2026, 8:28 a.m.
Created at: April 10, 2026, 12:04 p.m.