Short Proofs for Some Symmetric Quantified Boolean Formulas

04/04/2018
by   Manuel Kauers, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2019

Schematic Refutations of Formula Schemata

Proof schemata are infinite sequences of proofs which are defined induct...
research
01/13/2021

Resolution with Symmetry Rule applied to Linear Equations

This paper considers the length of resolution proofs when using Krishnam...
research
09/30/2009

Algorithms for finding dispensable variables

This short note reviews briefly three algorithms for finding the set of ...
research
01/24/2020

Results of nested canalizing functions

Boolean nested canalizing functions (NCF) have important applications in...
research
11/13/2002

Vanquishing the XCB Question: The Methodology Discovery of the Last Shortest Single Axiom for the Equivalential Calculus

With the inclusion of an effective methodology, this article answers in ...
research
03/26/2018

On Expansion and Resolution in CEGAR Based QBF Solving

A quantified Boolean formula (QBF) is a propositional formula extended w...
research
05/12/2022

Relating Information and Proof

In mathematics information is a number that measures uncertainty (entrop...

Please sign up or login with your details

Forgot password? Click here to reset