Parameterized Resolution with bounded conjunction
Logic in Computer Science
2012-04-16 v1
Abstract
We provide separations between the parameterized versions of Res(1) (Resolution) and Res(2). Using a different set of parameterized contradictions, we also separate the parameterized versions of Res*(1) (tree-Resolution) and Res*(2).
Cite
@article{arxiv.1204.2983,
title = {Parameterized Resolution with bounded conjunction},
author = {Stefan Dantchev and Barnaby Martin},
journal= {arXiv preprint arXiv:1204.2983},
year = {2012}
}