QBFFam: a tool for generating QBF families from proof complexity
type: Item
instance of: scholarly article
title: QBFFam: a tool for generating QBF families from proof complexity
DOI: 10.1007/978-3-030-80223-3_3
author: Olaf Beyersdorff
author: Luca Pulina
author: Martina Seidl
author: Ankit Shukla
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R07
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7495563
zbMATH Keywords: quantified Boolean formulas
zbMATH Keywords: formula generator
zbMATH Keywords: benchmarking
describes a project that uses: RAReQS
describes a project that uses: CNFgen
describes a project that uses: DepQBF
MaRDI profile type: Publication
full work available at URL: 978-3-030-80223-3 3
OpenAlex ID: W3184306867
cites work: Unified QBF certification and its applications
cites work: QBF Resolution Systems and Their Proof Complexities
cites work: Q5715680
cites work: Dynamic QBF Dependencies in Reduction and Expansion
cites work: A simple proof of QBF hardness
cites work: Q4625702
cites work: Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
cites work: Building strategies into QBF proofs
cites work: New Resolution-Based QBF Calculi and Their Proof Complexity
cites work: Q5270089
cites work: Proof complexity of QBF symmetry recomputation
cites work: Automated Testing and Debugging of SAT and QBF Solvers
cites work: New Results on the Phase Transition for Random Quantified Boolean Formulas
cites work: Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
cites work: Contributions to the Theory of Practical Quantified Boolean Formula Solving
cites work: The intractability of resolution
cites work: On Q-Resolution and CDCL QBF Solving
cites work: Solving QBF with counterexample guided refinement
cites work: Expansion-based QBF solving versus Q-resolution
cites work: Short proofs for some symmetric quantified Boolean formulas
cites work: Symmetries of quantified Boolean formulas
cites work: Resolution for quantified Boolean formulas
cites work: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
cites work: On the power of clause-learning SAT solvers as resolution engines
cites work: The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
cites work: CAQE and QuAbS: Abstraction Based QBF Solvers
description: scientific article; zbMATH DE number 7495563