QBFFam: A Tool for Generating QBF Families from Proof Complexity

Beyersdorff, Olaf; Pulina, Luca; Seidl, Martina; Shukla, Ankit

doi:10.1007/978-3-030-80223-3_3

Cited by 4 publications

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. A track of crafted formulas was introduced into QBFEval 2020 and a tool to generate the mentioned QBF families was presented by Beyersdorff, Pulina, Seidl, and Shukla (2021b). 2.…”

confidence: 99%

Classes of Hard Formulas for QBF Resolution

Schleitzer,

Beyersdorff

2023

jair

View full text Add to dashboard Cite

To date, we know only a few handcrafted quantified Boolean formulas (QBFs) that are hard for central QBF resolution systems such as Q-Res and QU-Res, and only one specific QBF family to separate Q-Res and QU-Res. Here we provide a general method to construct hard formulas for Q-Res and QU-Res. The construction uses simple propositional formulas (e.g. minimally unsatisfiable formulas) in combination with easy QBF gadgets (Σb2 formulas without constant winning strategies). This leads to a host of new hard formulas, including new classes of hard random QBFs. We further present generic constructions for formulas separating Q-Res and QU-Res, and for separating Q-Res and LD-Q-Res.

show abstract

“…1. A track of crafted formulas was introduced into QBFEval 2020 and a tool to generate the mentioned QBF families was presented by Beyersdorff, Pulina, Seidl, and Shukla (2021b). 2.…”

confidence: 99%

Classes of Hard Formulas for QBF Resolution

Schleitzer,

Beyersdorff

2023

jair

View full text Add to dashboard Cite

show abstract

True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers

Heisinger,

Seidl

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Booleguru, the Propositional Polyglot (Short Paper)

Heisinger,

Seidl

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Recent approaches on verification and reasoning solve SAT and QBF encodings using state-of-the-art SMT solvers, as it “makes implementation much easier”. The ease-of-use of these solvers make SAT and QBF solvers less visible to users of solvers—who are maybe from different research communities—potentially not exploiting the power of state-of-the-art tools. In this work, we motivate the need to build bridges over the widening solver-gap and introduce Booleguru, a tool to convert between formats for logic formulas. It makes SAT and QBF solvers more accessible by using techniques known from SMT solvers, such as advanced Python interfaces like Z3Py and easily generatable languages like SMT-LIB, integrating them to our conversion tool. We then introduce a language to manipulate and combine multiple formulas, optionally applying transformations for quickly prototyping encodings. Booleguru’s advanced scripting capabilities form a programming environment specialized for Boolean logic, offering a more efficient way to develop novel problem encodings.

show abstract

QBFFam: A Tool for Generating QBF Families from Proof Complexity

Cited by 4 publications

References 27 publications

Classes of Hard Formulas for QBF Resolution

Classes of Hard Formulas for QBF Resolution

True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers

Booleguru, the Propositional Polyglot (Short Paper)

Contact Info

Product

Resources

About