Symmetries of Quantified Boolean Formulas

02/12/2018
by   Manuel Kauers, et al.
0

While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF). There are some works introducing adaptions of propositional symmetry breaking techniques, with a theory covering only very specific parts of QBF symmetries. We present a general framework that gives a concise characterization of symmetries of QBF. Our framework naturally incorporates the duality of universal and existential symmetries resulting in a general basis for QBF symmetry breaking.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2019

Improving Reasoning on DQBF

The aim of this PhD project is to develop fast and robust reasoning tool...
research
11/17/2017

Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems

In the context of SAT solvers, Shatter is a popular tool for symmetry br...
research
12/09/2022

A Critique of Sopin's "PH = PSPACE"

We critique Valerii Sopin's paper "PH = PSPACE" [Sop14]. The paper clai...
research
03/25/2023

Using Unit Propagation with Universal Reduction in DQBF Preprocessing

Several effective preprocessing techniques for Boolean formulas with and...
research
05/25/2022

SAT Preprocessors and Symmetry

Exploitation of symmetries is an indispensable approach to solve certain...
research
05/12/2019

Quantifier Localization for DQBF

Dependency quantified Boolean formulas (DQBFs) are a powerful formalism,...
research
04/29/2019

QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties

We present version 2.0 of QRATPre+, a preprocessor for quantified Boolea...

Please sign up or login with your details

Forgot password? Click here to reset