Triple

T5465192
Position Surface form Disambiguated ID Type / Status
Subject Donald W. Loveland E122690 entity
Predicate authorOf P4244 FINISHED
Object "Automated Theorem Proving: A Logical Basis" (book) E523154 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: "Automated Theorem Proving: A Logical Basis" (book) | Statement: [Donald W. Loveland, authorOf, "Automated Theorem Proving: A Logical Basis" (book)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: "Automated Theorem Proving: A Logical Basis" (book)
Context triple: [Donald W. Loveland, authorOf, "Automated Theorem Proving: A Logical Basis" (book)]
  • A. "Automated Theorem Proving: A Logical Basis" chosen
    "Automated Theorem Proving: A Logical Basis" is a foundational textbook that presents the logical theory and algorithms underlying automated reasoning and theorem-proving systems in computer science and mathematical logic.
  • B. First-Order Logic and Automated Theorem Proving
    "First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
  • C. Handbook of Automated Reasoning
    The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
  • D. "The Complexity of Theorem-Proving Procedures"
    "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
  • E. Vampire automated theorem prover
    Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
  • 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_69bd4643f16081908d7f29e08096115a completed March 20, 2026, 1:06 p.m.
NER Named-entity recognition batch_69bd920590b481909b92091678ff1414 completed March 20, 2026, 6:29 p.m.
NED1 Entity disambiguation (via context triple) batch_69bf6c6c2454819096da8367f6b94233 completed March 22, 2026, 4:13 a.m.
Created at: March 20, 2026, 2:08 p.m.