"Automated Theorem Proving: A Logical Basis"
E523154
"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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| "Automated Theorem Proving: A Logical Basis" canonical | 1 |
| "Automated Theorem Proving: A Logical Basis" (book) | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5465191 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: "Automated Theorem Proving: A Logical Basis" Context triple: [Donald W. Loveland, authorOf, "Automated Theorem Proving: A Logical Basis"]
-
A.
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.
-
B.
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.
-
C.
"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.
-
D.
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.
-
E.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
- 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: "Automated Theorem Proving: A Logical Basis" Target entity description: "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.
-
A.
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.
-
B.
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.
-
C.
"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.
-
D.
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.
-
E.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
- F. None of above. chosen
Statements (29)
| Predicate | Object |
|---|---|
| instanceOf |
non-fiction book
ⓘ
textbook ⓘ |
| aim |
to explain algorithms used in theorem-proving systems
ⓘ
to present a logical basis for automated theorem proving ⓘ |
| describedAs |
foundational textbook on automated theorem proving
ⓘ
introduction to logical theory and algorithms for automated reasoning ⓘ |
| field |
automated reasoning
ⓘ
automated theorem proving ⓘ computer science ⓘ mathematical logic ⓘ |
| focus |
algorithms for automated theorem proving
ⓘ
logical theory underlying theorem-proving systems ⓘ |
| genre |
computer science textbook
ⓘ
logic textbook ⓘ technical literature ⓘ |
| relatedTo |
automated reasoning systems
ⓘ
formal verification ⓘ logic in computer science ⓘ theorem-proving software ⓘ |
| topic |
algorithms for theorem proving
ⓘ
automated deduction ⓘ formal logic ⓘ logical calculi ⓘ logical foundations of theorem proving ⓘ proof theory ⓘ resolution methods ⓘ search strategies in theorem proving ⓘ |
| use |
graduate-level teaching
ⓘ
reference for researchers in automated reasoning ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: "Automated Theorem Proving: A Logical Basis" Description of subject: "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.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: "Automated Theorem Proving: A Logical Basis"