Width and size of regular resolution proofs
arXiv:1205.1050 · doi:10.2168/LMCS-8(2:8)2012
Abstract
This paper discusses the topic of the minimum width of a regular resolution refutation of a set of clauses. The main result shows that there are examples having small regular resolution refutations, for which any regular refutation must contain a large clause. This forms a contrast with corresponding results for general resolution refutations.
The article was reformatted using the style file for Logical Methods in Computer Science