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

DOI10.1007/978-3-031-16681-5_19OpenAlexW4296193292MaRDI QIDQ6102979

Manuel Kauers, Sibylle Möhle, Martina Seidl, Ankit Shukla

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

quantified Boolean formulassolution counting\#\textsf{QBF}

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
• Backjumping for quantified Boolean logic satisfiability
• A structure-preserving clause form translation
• Assessing heuristic machine learning explanations with model counting
• Counting the number of solutions for instances of satisfiability
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• On the complexity of inconsistency measurement
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Clause Elimination for SAT and QSAT
• Polynomial Space Counting Problems
• Scalable Approximation of Quantitative Information Flow in Programs
• $$\#\exists $$ SAT: Projected Model Counting
• ALLQBF Solving by Computational Learning
• Conflict-Driven Answer Set Enumeration
• Tools and Algorithms for the Construction and Analysis of Systems
• Principles and Practice of Constraint Programming – CP 2004

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