Triple

T19494843
Position Surface form Disambiguated ID Type / Status
Subject Paris C. Kanellakis E487741 entity
Predicate coAuthorOf P2389 FINISHED
Object Constraint Query Languages 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: Constraint Query Languages | Statement: [Paris C. Kanellakis, coAuthorOf, Constraint Query Languages]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Constraint Query Languages
Context triple: [Paris C. Kanellakis, coAuthorOf, Constraint Query Languages]
  • A. OWL 2 QL
    OWL 2 QL is a lightweight profile of the Web Ontology Language designed to enable efficient query answering over large datasets using standard relational database technologies.
  • B. Object Constraint Language
    Object Constraint Language is a formal specification language used primarily to define precise rules, constraints, and queries on UML models within software and systems modeling.
  • C. Constraint Handling Rules
    Constraint Handling Rules is a high-level declarative programming language extension designed for writing and solving constraint-based systems through rule-based transformations.
  • D. Datalog
    Datalog is a declarative logic programming language, often used in databases and program analysis, that restricts Prolog-like syntax to a safe, recursion-friendly subset without complex terms or function symbols.
  • E. Principles and Practice of Declarative Programming
    Principles and Practice of Declarative Programming is an international academic conference focused on research and advances in declarative programming languages and paradigms.
  • 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: Constraint Query Languages
Target entity description: Constraint Query Languages is a foundational work in database theory that develops query languages capable of expressing and reasoning about data subject to complex logical constraints.
  • A. OWL 2 QL
    OWL 2 QL is a lightweight profile of the Web Ontology Language designed to enable efficient query answering over large datasets using standard relational database technologies.
  • B. Object Constraint Language
    Object Constraint Language is a formal specification language used primarily to define precise rules, constraints, and queries on UML models within software and systems modeling.
  • C. Constraint Handling Rules
    Constraint Handling Rules is a high-level declarative programming language extension designed for writing and solving constraint-based systems through rule-based transformations.
  • D. Datalog
    Datalog is a declarative logic programming language, often used in databases and program analysis, that restricts Prolog-like syntax to a safe, recursion-friendly subset without complex terms or function symbols.
  • E. Principles and Practice of Declarative Programming
    Principles and Practice of Declarative Programming is an international academic conference focused on research and advances in declarative programming languages and paradigms.
  • 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_69d8e8d9d1c88190b01cd78b8be49384 completed April 10, 2026, 12:11 p.m.
NER Named-entity recognition batch_69e63490c16481908423e304d82722d7 completed April 20, 2026, 2:13 p.m.
Created at: April 10, 2026, 1:40 p.m.