Resolution and Pebbling Games

Abstract

We define a collection of Prover-Delayer games that characterize certain subsystems of resolution. This allows us to give some natural criteria which guarantee lower bounds on the resolution width of a formula, and to extend these results to formulas of unbounded initial width. We also use games to give upper bounds on proof size, and in particular describe… (More)
DOI: 10.1007/11499107_6

Topics

Cite this paper

@article{Galesi2004ResolutionAP, title={Resolution and Pebbling Games}, author={Nicola Galesi and Neil Thapen}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2004} }