Short Proofs for Some Symmetric Quantified Boolean Formulas
classification
💻 cs.LO
keywords
handproofsshortsymmetrybooleanbreakerscalculicalculus
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.