First-Order Logic and Automated Theorem Proving
E504787
"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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| First-Order Logic and Automated Theorem Proving canonical | 2 |
| First-Order Logic and Automated Theorem Proving (book with Richard L. Mendelsohn) | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5234091 — 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: First-Order Logic and Automated Theorem Proving Context triple: [Melvin Fitting, notableWork, First-Order Logic and Automated Theorem Proving]
-
A.
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.
-
B.
"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.
-
C.
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.
-
D.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
E.
Journal of Automated Reasoning
The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of 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: First-Order Logic and Automated Theorem Proving Target entity description: "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.
-
A.
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.
-
B.
"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.
-
C.
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.
-
D.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
E.
Journal of Automated Reasoning
The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
- F. None of above. chosen
Statements (37)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
logic textbook ⓘ non-fiction book ⓘ textbook ⓘ |
| aim |
to present key methods used in automated theorem proving
ⓘ
to provide a systematic introduction to first-order logic ⓘ |
| approach | formal and algorithmic ⓘ |
| audience |
advanced undergraduates
ⓘ
graduate students ⓘ researchers in logic and AI ⓘ |
| covers |
algorithmic aspects of theorem proving
ⓘ
implementation-oriented methods for deduction systems ⓘ logical calculi for first-order logic ⓘ |
| field |
artificial intelligence
ⓘ
automated theorem proving ⓘ computer science ⓘ first-order logic ⓘ mathematical logic ⓘ |
| genre | academic textbook ⓘ |
| language | English ⓘ |
| title | First-Order Logic and Automated Theorem Proving ⓘ |
| topic |
Herbrand’s theorem
ⓘ
linked to:
Herbrand's theorem
Skolemization ⓘ automated deduction algorithms ⓘ completeness of proof systems ⓘ decision procedures for logical theories ⓘ logic programming foundations ⓘ proof systems for first-order logic ⓘ refutation-based theorem proving ⓘ resolution calculus ⓘ search strategies in theorem proving ⓘ semantics of first-order logic ⓘ soundness of proof systems ⓘ syntax of first-order logic ⓘ unification algorithms ⓘ |
| use |
reference for automated reasoning
ⓘ
university course textbook ⓘ |
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: First-Order Logic and Automated Theorem Proving Description of subject: "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.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
Melvin Fitting
→
notableWork
→
First-Order Logic and Automated Theorem Proving (book with Richard L. Mendelsohn)
ⓘ
linked to: First-Order Logic and Automated Theorem Proving
First-Order Logic and Automated Theorem Proving
→
title
→
First-Order Logic and Automated Theorem Proving
ⓘ