OuterCount: a first-level solution-counter for quantified Boolean formulas

DOI10.1007/978-3-031-16681-5_19MaRDI QIDQ6102979zbMATH OpenOpenAlexFDO

Authors Ankit Shukla, Sibylle Möhle, M. Kauers, Martina Seidl

Publication date 2 June 2023

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-16681-5_19

zbMATH Keywords

\#\textsf{QBF}quantified Boolean formulassolution counting

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Satisfiability Testing
• Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
• Principles and Practice of Constraint Programming – CP 2004
• Solving QBF with counterexample guided refinement

Cites work

• \(\#{\exists}\mathrm{SAT}\): projected model counting
• A structure-preserving clause form translation
• ALLQBF solving by computational learning
• Assessing heuristic machine learning explanations with model counting
• Backjumping for quantified Boolean logic satisfiability
• Clause elimination for SAT and QSAT
• Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
• Conflict-Driven Answer Set Enumeration
• 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 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 1315584 (Why is no real title available?)
• scientific article; zbMATH DE number 1950260 (Why is no real title available?)
• On the complexity of inconsistency measurement
• Polynomial Space Counting Problems
• Principles and Practice of Constraint Programming – CP 2004
• Scalable approximation of quantitative information flow in programs
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(2)

• Models and counter-models of quantified Boolean formulas (invited talk)
• Counting QBF solutions at level two

This page was built for publication: OuterCount: a first-level solution-counter for quantified Boolean formulas

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