Triple
T2139641
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Martin Davis |
E46731
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Davis–Putnam–Logemann–Loveland procedure |
E238240
|
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: Davis–Putnam–Logemann–Loveland procedure | Statement: [Martin Davis, knownFor, Davis–Putnam–Logemann–Loveland procedure]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Davis–Putnam–Logemann–Loveland procedure Context triple: [Martin Davis, knownFor, Davis–Putnam–Logemann–Loveland procedure]
-
A.
Davis–Putnam algorithm
chosen
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
B.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
-
C.
Herbrand's theorem
Herbrand's theorem is a fundamental result in mathematical logic and proof theory that characterizes the validity of first-order formulas via finite sets of ground instances, forming a basis for automated theorem proving.
-
D.
Herbrand disjunction
Herbrand disjunction is a logical formula formed as a finite disjunction of ground instances of a first-order formula, central to Herbrand’s theorem in proof theory and automated reasoning.
-
E.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
- 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_69a88a174ab48190a5db20c132e5dccf |
completed | March 4, 2026, 7:37 p.m. |
| NER | Named-entity recognition | batch_69abbe025d3c81908bcb33a7ff09eae8 |
completed | March 7, 2026, 5:56 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae6533c7f081909860c89a2a53ad49 |
completed | March 9, 2026, 6:14 a.m. |
Created at: March 4, 2026, 7:44 p.m.