Short Proofs for Some Symmetric Quantified Boolean Formulas
Logic in Computer Science
2018-04-05 v1
Abstract
We exploit symmetries to give short proofs for two prominent formula families of QBF proof complexity. On the one hand, we employ symmetry breakers. On the other hand, we enrich the (relatively weak) QBF resolution calculus Q-Res with the symmetry rule and obtain separations to powerful QBF calculi.
Cite
@article{arxiv.1804.01437,
title = {Short Proofs for Some Symmetric Quantified Boolean Formulas},
author = {Manuel Kauers and Martina Seidl},
journal= {arXiv preprint arXiv:1804.01437},
year = {2018}
}