On the structure of some classes of minimal unsatisfiable formulas

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 intractability of resolution

Armin Haken · Theoretical Computer Science · 1985 · 829 citations

Computing, Computer Science, Mathematics +5

Hard examples for resolution

Alasdair Urquhart · Journal of the ACM · 1987 · 451 citations · Full text

Computing, Computer Science, Formal Methods +16

Many hard examples for resolution

Vašek Chvátal, Endre Szemerédi · Journal of the ACM · 1988 · 445 citations · Full text

Computing, Computer Science, Mathematics +11