Triple
T17677632
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Prolog |
E440678
|
entity |
| Predicate | hasStandard |
P1371
|
FINISHED |
| Object | ISO Prolog |
—
|
NE NERFINISHED |
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: ISO Prolog | Statement: [Prolog, hasStandard, ISO Prolog]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: ISO Prolog Context triple: [Prolog, hasStandard, ISO Prolog]
-
A.
Prolog
chosen
Prolog is a high-level logic programming language rooted in formal logic and widely used in artificial intelligence, natural language processing, and symbolic reasoning.
-
B.
LambdaProlog
LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
-
C.
Isabelle/FOL
Isabelle/FOL is the classical first-order logic object logic of the Isabelle proof assistant, providing a framework for formalizing and verifying mathematical theorems and logical systems.
-
D.
Franz Lisp
Franz Lisp is a dialect of the Lisp programming language developed in the late 1970s at the University of California, Berkeley, primarily for use in artificial intelligence research and symbolic computation.
-
E.
Yices
Yices is a high-performance Satisfiability Modulo Theories (SMT) solver widely used in formal verification and automated reasoning.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69d8b9e940b081908b862bb0e6e89b0d |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e46f6e959c819092d9d33e79bd51f7 |
completed | April 19, 2026, 6 a.m. |
Created at: April 10, 2026, 10:01 a.m.