A note on SAT algorithms and proof complexity

A machine program for theorem-proving

Martin Davis, George Logemann, Donald Loveland · Communications of the ACM · 1962 · 3.2K citations · Full text

Computing, Computer Science, Mathematics +16

A Computing Procedure for Quantification Theory

Martin Davis, Hilary Putnam · Journal of the ACM · 1960 · 2.6K citations · Full text

Computing, Computer Science, Mathematics +15

The relative efficiency of propositional proof systems

Stephen Cook, Robert A. Reckhow · Journal of Symbolic Logic · 1979 · 827 citations

Computing, Computer Science, Mathematics +15

Towards Understanding and Harnessing the Potential of Clause Learning

Paul Beame, Henry Kautz, Ashish Sabharwal · Journal of Artificial Intelligence Research · 2004 · 288 citations · Full text

Computing, Computer Science, Algorithms +14

Propositional proof systems, the consistency of first order theories and the complexity of computations

Jan Krajı́ček, Pavel Pudlák · Journal of Symbolic Logic · 1989 · 202 citations

Humanities, Computer Science, Mathematics +11