Refinement-based enumeration of QBF solutions

DOI10.1007/978-3-032-04590-4_12MaRDI QIDQ6884713zbMATH OpenFDO

Authors Andreas Plank, Clemens Hofstadler, Maximilian Heisinger, Martina Seidl

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-032-04590-4_12

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• ALLQBF solving by computational learning
• Assessing heuristic machine learning explanations with model counting
• Clause elimination for SAT and QSAT
• Counting QBF solutions at level two
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• scientific article; zbMATH DE number 1470716 (Why is no real title available?)
• Polynomial Space Counting Problems
• Scalable approximation of quantitative information flow in programs
• True crafted formula families for benchmarking quantified satisfiability solvers

This page was built for publication: Refinement-based enumeration of QBF solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884713)