Evaluating QBF Solvers: Quantifier Alternations Matter

  title={Evaluating QBF Solvers: Quantifier Alternations Matter},
  author={Florian Lonsing and U. Egly},
  • Florian Lonsing, U. Egly
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
  • We present an experimental study of the effects of quantifier alternations on the evaluation of quantified Boolean formula (QBF) solvers. The number of quantifier alternations in a QBF in prenex conjunctive normal form (PCNF) is directly related to the theoretical hardness of the respective QBF satisfiability problem in the polynomial hierarchy. We show empirically that the performance of solvers based on different solving paradigms substantially varies depending on the numbers of alternations… CONTINUE READING
    19 Citations
    Dependency Learning for QBF
    • 34
    Expansion-Based QBF Solving Without Recursion
    • 5
    • PDF
    DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
    • 30
    • PDF
    Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
    Reasons for Hardness in QBF Proof Systems
    Reasons for Hardness in Quantified Boolean Formulas ?
    Lower Bounds for QBFs of Bounded Treewidth
    • 2
    • PDF
    Reasons for Hardness in QBF Proof Systems
    • 21
    • PDF
    Short Proofs in QBF Expansion
    • 4


    Solving QBF with counterexample guided refinement
    • 177
    • PDF
    Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers
    • 54
    • PDF
    CAQE: A Certifying QBF Solver
    • 78
    • PDF
    Q-Resolution with Generalized Axioms
    • 24
    • PDF
    Dependency Learning for QBF
    • 34
    Conflict driven learning in a quantified Boolean Satisfiability solver
    • 130
    • PDF
    On Expansion and Resolution in CEGAR Based QBF Solving
    • 19
    • PDF
    Expansion-based QBF Solving on Tree Decompositions
    • 12
    • Highly Influential
    • PDF
    Solving QBF Instances with Nested SAT Solvers
    • 16
    • PDF