2QBF: Challenges and Solutions

2QBF is a special form \(\forall \varvec{x} \exists \varvec{y}.\phi \) of the quantified Boolean formula (QBF) restricted to only two quantification layers, where \(\phi \) is a quantifier-free formula. Despite its restricted form, it provides a framework for a wide range of applications, such as artificial intelligence, graph theory, synthesis, etc. In this work, we overview two main 2QBF challenges in terms of solving and certification. We contribute several improvements to existing solving approaches and study how the corresponding approaches affect certification. We further conduct an extensive experimental comparison on both competition and application benchmarks to demonstrate strengths of the proposed methodology.

[1]  Klaus Truemper,et al.  An Effective Algorithm for the Futile Questioning Problem , 2005, Journal of Automated Reasoning.

[2]  Robert K. Brayton,et al.  Technology Mapping into General Programmable Cells , 2015, FPGA.

[3]  Mikolás Janota,et al.  Solving QBF with Counterexample Guided Refinement , 2012, SAT.

[4]  Mikolás Janota,et al.  Solving QBF by Clause Selection , 2015, IJCAI.

[5]  Jie-Hong Roland Jiang,et al.  Unified QBF certification and its applications , 2012, Formal Methods Syst. Des..

[6]  Armando Tacchella,et al.  QuBE++: An Efficient QBF Solver , 2004, FMCAD.

[7]  Christoph Scholl,et al.  Exploiting structure in an AIG based QBF solver , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

[8]  Ofer Strichman,et al.  Faster Extraction of High-Level Minimal Unsatisfiable Cores , 2011, SAT.

[9]  Armando Tacchella,et al.  Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas , 2006, J. Artif. Intell. Res..

[10]  Mikolás Janota,et al.  Abstraction-Based Algorithm for 2QBF , 2011, SAT.

[11]  Armin Biere,et al.  DepQBF: A Dependency-Aware QBF Solver (System Description) , 2010 .

[12]  G. S. Tseitin On the Complexity of Derivation in Propositional Calculus , 1983 .

[13]  Marco Benedetti,et al.  sKizzo: A Suite to Evaluate and Certify QBFs , 2005, CADE.

[14]  Karem A. Sakallah,et al.  Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution , 2003, SAT.

[15]  Armin Biere,et al.  DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..

[16]  Joao Marques-Silva,et al.  Boolean satisfiability in electronic design automation , 2000, Proceedings 37th Design Automation Conference.

[17]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[18]  Armin Biere,et al.  Blocked Clause Elimination for QBF , 2011, CADE.