Counting QBF solutions at level two

DOI10.1007/S10601-024-09369-4MaRDI QIDQ7031952zbMATH OpenFDO

Authors Andreas Plank, Sibylle Möhle, Martina Seidl

Publication date 6 February 2025

Published in Constraints (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10601-024-09369-4

zbMATH Keywords

enumerationQBFquantified Boolean formulassecond-level model counting

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07)

Cites work

• Assessing heuristic machine learning explanations with model counting
• Counting the number of solutions for instances of satisfiability
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• scientific article; zbMATH DE number 1315584 (Why is no real title available?)
• scientific article; zbMATH DE number 1470716 (Why is no real title available?)
• OuterCount: a first-level solution-counter for quantified Boolean formulas
• Polynomial Space Counting Problems
• Scalable approximation of quantitative information flow in programs
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• The complexity of problems for quantified constraints

Cited in

(1)

• Refinement-based enumeration of QBF solutions

This page was built for publication: Counting QBF solutions at level two

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