A Computing Procedure for Quantification Theory
E822899
"A Computing Procedure for Quantification Theory" is a seminal 1960 paper by Martin Davis and Hilary Putnam that introduced the Davis–Putnam algorithm, laying foundational work for automated theorem proving and propositional satisfiability.
All labels observed (1)
| Label | Occurrences |
|---|---|
| A Computing Procedure for Quantification Theory canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T9809837 — 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: A Computing Procedure for Quantification Theory Context triple: [Davis–Putnam algorithm, describedIn, A Computing Procedure for Quantification Theory]
-
A.
"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.
-
B.
the Logic Theorist program
The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
-
C.
On a Problem of Formal Logic
"On a Problem of Formal Logic" is a seminal philosophical and mathematical paper by F. P. Ramsey that contributed to the foundations of logic and helped inspire what is now known as Ramsey theory.
-
D.
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.
-
E.
An Axiomatic Basis for Computer Programming
"An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
- 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: A Computing Procedure for Quantification Theory Target entity description: "A Computing Procedure for Quantification Theory" is a seminal 1960 paper by Martin Davis and Hilary Putnam that introduced the Davis–Putnam algorithm, laying foundational work for automated theorem proving and propositional satisfiability.
-
A.
"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.
-
B.
the Logic Theorist program
The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
-
C.
On a Problem of Formal Logic
"On a Problem of Formal Logic" is a seminal philosophical and mathematical paper by F. P. Ramsey that contributed to the foundations of logic and helped inspire what is now known as Ramsey theory.
-
D.
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.
-
E.
An Axiomatic Basis for Computer Programming
"An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
- F. None of above. chosen
Statements (38)
| Predicate | Object |
|---|---|
| instanceOf |
logic paper
ⓘ
scientific paper ⓘ |
| author |
Hilary Putnam
ⓘ
Martin Davis ⓘ |
| citedFor |
Davis–Putnam algorithm
ⓘ
foundational ideas in automated theorem proving ⓘ |
| coAuthorOrder |
Martin Davis; Hilary Putnam
ⓘ
linked to:
Martin Davis
|
| contributionTo |
decision procedures for first-order logic
ⓘ
foundations of automated theorem proving ⓘ |
| describedAs |
foundational work for propositional satisfiability
ⓘ
seminal paper in automated theorem proving ⓘ |
| field |
artificial intelligence
ⓘ
automated theorem proving ⓘ computer science ⓘ mathematical logic ⓘ propositional satisfiability ⓘ |
| hasAuthorRole |
Hilary Putnam is a philosopher and logician
ⓘ
linked to:
Hilary Putnam
Martin Davis is a logician and computer scientist ⓘ |
| hasNotableConcept |
elimination of quantifiers in certain logical theories
ⓘ
systematic search procedures for logical formulas ⓘ |
| historicalSignificance | early example of using computation for logical inference ⓘ |
| influenced |
Davis–Putnam–Logemann–Loveland algorithm
ⓘ
linked to:
DPLL algorithm
|
| influencedField |
SAT solving
ⓘ
automated reasoning ⓘ |
| introducesAlgorithm | Davis–Putnam algorithm ⓘ |
| language | English ⓘ |
| mainContribution | introduction of the Davis–Putnam algorithm ⓘ |
| publicationDecade | 1960s ⓘ |
| relatedTo |
first-order logic
ⓘ
mechanical theorem proving ⓘ quantified formulas ⓘ |
| title | A Computing Procedure for Quantification Theory ⓘ |
| topic |
decision procedures
ⓘ
quantification theory ⓘ satisfiability ⓘ |
| usedIn |
research on SAT solvers
ⓘ
research on decision procedures for logic ⓘ |
| yearOfPublication | 1960 ⓘ |
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: A Computing Procedure for Quantification Theory Description of subject: "A Computing Procedure for Quantification Theory" is a seminal 1960 paper by Martin Davis and Hilary Putnam that introduced the Davis–Putnam algorithm, laying foundational work for automated theorem proving and propositional satisfiability.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
A Computing Procedure for Quantification Theory
→
title
→
A Computing Procedure for Quantification Theory
ⓘ