"Logic for Computer Science: Foundations of Automatic Theorem Proving"
E524533
"Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
All labels observed (2)
| Label | Occurrences |
|---|---|
| "Logic for Computer Science: Foundations of Automatic Theorem Proving" canonical | 1 |
| A Computational Logic | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5465193 — 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: "Logic for Computer Science: Foundations of Automatic Theorem Proving" Context triple: [Donald W. Loveland, authorOf, "Logic for Computer Science: Foundations of Automatic Theorem Proving"]
-
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.
"Automated Theorem Proving: A Logical Basis"
"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.
-
C.
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.
-
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.
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.
- 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: "Logic for Computer Science: Foundations of Automatic Theorem Proving" Target entity description: "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
-
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.
"Automated Theorem Proving: A Logical Basis"
"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.
-
C.
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.
-
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.
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.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
logic textbook ⓘ non-fiction book ⓘ textbook ⓘ |
| aimsTo |
connect logic with applications in computer science
ⓘ
introduce logical foundations of automated theorem proving ⓘ present practical techniques for automatic theorem proving ⓘ |
| field |
mathematical logic in computer science
ⓘ
theoretical computer science ⓘ |
| hasApplication |
artificial intelligence
ⓘ
deductive databases ⓘ formal specification of software ⓘ hardware verification ⓘ knowledge representation ⓘ program verification ⓘ |
| hasSubject |
Herbrand’s theorem
ⓘ
linked to:
Herbrand's theorem
Skolemization ⓘ automated reasoning ⓘ automated theorem proving ⓘ complexity of proof procedures ⓘ computer science ⓘ constraint solving ⓘ decision procedures ⓘ first-order logic ⓘ formal methods ⓘ formal verification ⓘ logic programming ⓘ mathematical logic ⓘ model theory (computer science) ⓘ natural deduction ⓘ proof theory ⓘ propositional logic ⓘ resolution calculus ⓘ satisfiability ⓘ search algorithms ⓘ sequent calculus ⓘ soundness and completeness ⓘ specification languages ⓘ tableaux methods ⓘ term rewriting ⓘ unification ⓘ |
| intendedAudience |
advanced undergraduate students
ⓘ
graduate students ⓘ practitioners of formal methods ⓘ researchers in computer science ⓘ |
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: "Logic for Computer Science: Foundations of Automatic Theorem Proving" Description of subject: "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
Donald W. Loveland
→
authorOf
→
"Logic for Computer Science: Foundations of Automatic Theorem Proving"
ⓘ
linked to: "Logic for Computer Science: Foundations of Automatic Theorem Proving"