True crafted formula families for benchmarking quantified satisfiability solvers

DOI10.1007/978-3-031-42753-4_20OpenAlexW4386297723MaRDI QIDQ6118844

Martina Seidl, Simone Heisinger

Publication date: 28 February 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-42753-4_20

zbMATH Keywords

benchmarkingQBFsolverKBKFQParity

Mathematics Subject Classification ID

Computer science support for mathematical research and practice (68Vxx)

Cites Work

• Unnamed Item
• A structure-preserving clause form translation
• QBFFam: a tool for generating QBF families from proof complexity
• On expansion and resolution in CEGAR based QBF solving
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Unified QBF certification and its applications
• Q-Resolution with Generalized Axioms
• Solving QBF with Counterexample Guided Refinement
• Clause Elimination for SAT and QSAT
• Contributions to the Theory of Practical Quantified Boolean Formula Solving
• New Resolution-Based QBF Calculi and Their Proof Complexity

This page was built for publication: True crafted formula families for benchmarking quantified satisfiability solvers