On subclasses of minimal unsatisfiable formulas

Linear-time algorithms for testing the satisfiability of propositional horn formulae

William F. Dowling, Jean Gallier · The Journal of Logic Programming · 1984 · 1K citations

Computing, Computer Science, Mathematics +11

A linear-time algorithm for testing the truth of certain quantified boolean formulas

Bengt Aspvall, Michael F. Plass, Robert E. Tarjan · Information Processing Letters · 1979 · 901 citations

Computing, Computer Science, Mathematics +14

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

The complexity of facets (and some facets of complexity)

Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1984 · 314 citations

Computing, Computer Science, Mathematics +10