Width and size of regular resolution proofs
Computational Complexity
2015-07-01 v3 Logic
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.
Cite
@article{arxiv.1205.1050,
title = {Width and size of regular resolution proofs},
author = {Alasdair Urquhart},
journal= {arXiv preprint arXiv:1205.1050},
year = {2015}
}
Comments
The article was reformatted using the style file for Logical Methods in Computer Science