A combinatorial characterization of resolution width

We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization is tight and purely combinatorial. Our first application of this result is a surprising proof that the minimum space of refuting a 3-CNF formula is always bounded from below by the minimum width of refuting it (minus 3). This solves a wellknown open problem. The second application is the unification of several width lower bound arguments, and a new width lower bound for the Dense Linear Order Principle. Since we also show that this principle has resolution refutations of polynomial size, this provides yet another example showing that the size-width relationship is tight.

• Type: Journal
• Year: 2008
• Where: JCSS
• Authors: Albert Atserias, Víctor Dalmau
• Keywords: JCSS 2008, Lower Bound, Propositional Proof Complexity, Width Lower Bound