On the complexity of resolution with bounded conjunctions

Abstract

We analyze size and space complexity of Res(k), a family of propositional proof systems introduced by Kraj which extend Resolution by allowing disjunctions of conjunctions of up to 1$ literals. We show that the treelike Res(k) proof systems form a strict hierarchy with respect to proof size and also with respect to space. Moreover Resolution, while simulating treelike Res(k), is almost exponentially separated from treelike Res(k). To study space complexity for general Res(k) we introduce the concept of dynamical satisfiability which allows us toprove in a unified way all known space lower bounds for Resolution and to extendthem to Res(k).