sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning
From MaRDI portal
Publication:4930581
DOI10.1007/978-3-642-14186-7_9zbMath1306.68157OpenAlexW1561543482WikidataQ62040548 ScholiaQ62040548MaRDI QIDQ4930581
Massimo Narizzano, Enrico Giunchiglia, Paolo Marin
Publication date: 29 September 2010
Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14186-7_9
Related Items
Solution validation and extraction for QBF preprocessing, The QBF Gallery: behind the scenes, Preprocessing for DQBF, Conformant planning as a case study of incremental QBF solving, Abstraction-Based Algorithm for 2QBF, Failed Literal Detection for QBF, Blocked Clause Elimination for QBF, sQueezeBF, Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations, The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17), The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1, Solving QBF with counterexample guided refinement
Uses Software
