The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games

The QBFGallery 2014 was a competitive evaluation for QBF solvers organized in the context of the FLoC 2014 Olympic Games of the Vienna Summer of Logic. Quantified Boolean formulas (QBF) extend formulas of propositional logic by existential and universal quantifiers over the propositional variables and, thus, lift the satisfiablity problem from NP to PSPACE. In consequence, there are many application problems from fields like verification, synthesis, and planning that can be encoded efficiently in QBF. This  motivates the quest for efficient QBF solvers. The QBFGallery 2014 invited the developers of QBF solvers to submit their tools to a competitive evaluation in a uniform environment. Gold, silver, and bronze track medals were awarded to the solvers that solved the most formulas in each of three different tracks covering various kinds of benchmarks. Additionally, the three participants that were most successful overall were decorated with Kurt G odel medals, the official prizes of the  Olympic Games. In this paper, we give an overview of the setup of the competition, we briefly review the participating solvers, and finally report on the results of the QBFGallery 2014.

[1]  Sharad Malik,et al.  Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation , 2002, CP.

[2]  Norbert Manthey.  Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation) , 2012, SAT.

[3]  Luca Pulina,et al.  Aqme'10 , 2010, J. Satisf. Boolean Model. Comput..

[4]  David Delahaye,et al.  Proceedings of the 6th IJCAR ATP System Competition (CASC-J6) , 2012 .

[5]  Edmund M. Clarke,et al.  A Non-prenex, Non-clausal QBF Solver with Game-State Learning , 2010, SAT.

[6]  Hans Kleine Büning,et al.  Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..

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

[8]  Radu Grigore,et al.  Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription , 2010, JELIA.

[9]  Mikolás Janota,et al.  Solving QBF with Free Variables , 2013, CP.

[10]  Fahiem Bacchus,et al.  Exploiting QBF Duality on a Circuit Representation , 2010, AAAI.

[11]  Hans Kleine Büning,et al.  Theory of Quantified Boolean Formulas , 2021, Handbook of Satisfiability.

[12]  Marko Samer,et al.  Backdoor Sets of Quantified Boolean Formulas , 2008, Journal of Automated Reasoning.

[13]  Enrico Giunchiglia,et al.  Planning as Quantified Boolean Formula , 2012, ECAI.

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

[15]  Armin Biere,et al.  Automated Reencoding of Boolean Formulas , 2012, Haifa Verification Conference.

[16]  Florian Lonsing,et al.  Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation , 2013, SAT.

[17]  Armando Tacchella,et al.  Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919) , 2004 .

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

[19]  Florian Lonsing,et al.  Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving , 2013, LPAR.

[20]  Florian Lonsing,et al.  The QBF Gallery: Behind the scenes , 2016, Artif. Intell..

[21]  Florian Lonsing,et al.  Extended Failed-Literal Preprocessing for Quantified Boolean Formulas , 2012, SAT.

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

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

[24]  Reinhold Letz,et al.  Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas , 2002, TABLEAUX.

[25]  Lukasz Kaiser,et al.  Experiments with Reduction Finding , 2013, SAT.

[26]  Enrico Giunchiglia,et al.  sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning , 2010, SAT.

[27]  Armin Biere,et al.  Failed Literal Detection for QBF , 2011, SAT.

[28]  Bernd Becker,et al.  Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs , 2010, SAT.

[29]  Lukasz Kaiser,et al.  Benchmarks from Reduction Finding , 2013 .

[30]  Bernd Becker,et al.  Provably optimal test cube generation using quantified boolean formula solving , 2013, 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC).

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

[32]  Marco Benedetti,et al.  QBF-Based Formal Verification: Experience and Perspectives , 2008, J. Satisf. Boolean Model. Comput..

[33]  Neil Immerman,et al.  Finding Reductions Automatically , 2010, Fields of Logic and Computation.

[34]  Fahiem Bacchus,et al.  Recovering and Utilizing Partial Duality in QBF , 2013, SAT.

[35]  Armin Biere,et al.  PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[36]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean Satisfiability solver , 2002, ICCAD 2002.