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.

Try in SPARQL Jump to: Statements Referenced by

Statements (38)

Predicate Object
instanceOf logic paper
scientific paper
author Hilary Putnam NERFINISHED
Martin Davis NERFINISHED
citedFor Davis–Putnam algorithm NERFINISHED
foundational ideas in automated theorem proving
coAuthorOrder Martin Davis; Hilary Putnam NERFINISHED
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 NERFINISHED
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 NERFINISHED
influencedField SAT solving
automated reasoning
introducesAlgorithm Davis–Putnam algorithm NERFINISHED
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 NERFINISHED
topic decision procedures
quantification theory
satisfiability
usedIn research on SAT solvers
research on decision procedures for logic
yearOfPublication 1960

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Davis–Putnam algorithm describedIn A Computing Procedure for Quantification Theory