Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer. The Complexity of Satisfiability Problems: Refining Schaefer s Theorem. Electronic Colloquium on Computational Complexity (ECCC), (100), 2004. [doi]
Abstract is missing.