Triple
T5357421
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dale Miller |
E102730
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | λProlog |
E143339
|
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: λProlog | Statement: [Dale Miller, notableConcept, λProlog]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: λProlog Context triple: [Dale Miller, notableConcept, λProlog]
-
A.
LambdaProlog
chosen
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.
-
B.
Prolog
Prolog is a high-level logic programming language rooted in formal logic and widely used in artificial intelligence, natural language processing, and symbolic reasoning.
-
C.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
D.
Kripke–Kleene semantics in logic programming
Kripke–Kleene semantics in logic programming is a three-valued, fixed-point-based approach to interpreting logic programs that captures partial or undefined information without committing to classical true/false evaluations.
-
E.
Practical Aspects of Declarative Languages
Practical Aspects of Declarative Languages is an academic conference focused on the practical implementation, application, and evaluation of declarative programming languages and related technologies.
- 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_69bd43d8f7248190b64c140734b5c9a8 |
completed | March 20, 2026, 12:55 p.m. |
| NER | Named-entity recognition | batch_69bd863099b081909d20f7014b98de5a |
completed | March 20, 2026, 5:38 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf21e6762481909278935a4eeee177 |
completed | March 21, 2026, 10:55 p.m. |
Created at: March 20, 2026, 2:01 p.m.