Quantifier Shifting for Quantified Boolean Formulas Revisited-Reference-Cited by-同舟云学术

Quantifier Shifting for Quantified Boolean Formulas Revisited

Published:2024 Issue: Volume: Page:325-343
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:en
Short-container-title:

Author:

Heisinger Simone^ORCID,Heisinger Maximilian^ORCID,Rebola-Pardo Adrian^ORCID,Seidl Martina^ORCID

Abstract

AbstractModern solvers for quantified Boolean formulas (QBFs) process formulas in prenex form, which divides each QBF into two parts: the quantifier prefix and the propositional matrix. While this representation does not cover the full language of QBF, every non-prenex formula can be transformed to an equivalent formula in prenex form. This transformation offers several degrees of freedom and blurs structural information that might be useful for the solvers. In a case study conducted 20 years back, it has been shown that the applied transformation strategy heavily impacts solving time. We revisit this work and investigate how sensitive recent QBF solvers perform w.r.t. various prenexing strategies.

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-63498-7_20

Reference31 articles.

1. Beyersdorff, O., Hinde, L., Pich, J.: Reasons for hardness in QBF proof systems. ACM Trans. Comput. Theory 12(2), 10:1–10:27 (2020). https://doi.org/10.1145/3378665

2. Beyersdorff, O., Janota, M., Lonsing, F., Seidl, M.: Quantified Boolean formulas. In: Handbook of Satisfiability – Second Edition, Frontiers in Artificial Intelligence and Applications, vol. 336, pp. 1177–1221. IOS Press (2021). https://doi.org/10.3233/FAIA201015

3. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);A Biere,2011

4. Charwat, G., Woltran, S.: BDD-based dynamic programming on tree decompositions. Technical report, Technische Universität Wien, Institut für Informationssysteme, Technical report (2016)

5. Charwat, G., Woltran, S.: Dynamic programming-based QBF solving. In: Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), Bordeaux, France, July 4, 2016. CEUR Workshop Proceedings, vol. 1719, pp. 27–40. CEUR-WS.org (2016)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Booleguru, the Propositional Polyglot (Short Paper);Lecture Notes in Computer Science;2024