Enumerative Level-2 Solution Counting for Quantified Boolean Formulas - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Enumerative Level-2 Solution Counting for Quantified Boolean Formulas

Abstract

We lift the problem of enumerative solution counting to quantified Boolean formulas (QBFs) at the second level. In contrast to the well-explored model counting problem for SAT (#SAT), where models are simply assignments to the Boolean variables of a formula, we are now dealing with tree (counter-)models reflecting the dependencies between the variables of the first and the second quantifier block. It turns out that enumerative counting on the second level does not give the complete model count. We present the-to the best of our knowledge-first approach of counting tree (counter-)models together with a counting tool that exploits state-of-the-art QBF technology. We provide several kinds of benchmarks for testing our implementation and illustrate in several case studies that solution counting provides valuable insights into QBF encodings.
Fichier principal
Vignette du fichier
LIPIcs.CP.2023.49.pdf (758.35 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04327008 , version 1 (06-12-2023)

Licence

Identifiers

Cite

Andreas Plank, Sibylle Möhle, Martina Seidl. Enumerative Level-2 Solution Counting for Quantified Boolean Formulas. 29th International Conference on Principles and Practice of Constraint Programming - CP 2023, Aug 2023, Toronto, Canada. ⟨10.4230/LIPIcs.CP.2023.49⟩. ⟨hal-04327008⟩
19 View
6 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More