Blocked Clause Elimination for QBF

Quantified Boolean formulas (QBF) provide a powerful framework for encoding problems from various application domains, not least because efficient QBF solvers are available. Despite sophisticated evaluation techniques, the performance of such a solver usually depends on the way a problem is represented. However, the translation to processable QBF encodings is in general not unique and may either introduce variables and clauses not relevant for the solving process or blur information which could be beneficial for the solving process. To deal with both of these issues, preprocessors have been introduced which rewrite a given QBF before it is passed to a solver. In this paper, we present novel preprocessing methods for QBF based on blocked clause elimination (BCE), a technique successfully applied in SAT. Quantified blocked clause elimination (QBCE) allows to simulate various structural preprocessing techniques as BCE in SAT. We have implemented QBCE and extensions of QBCE in the preprocessor bloqqer. In our experiments we show that preprocessing with QBCE reduces formulas substantially and allows us to solve considerable more instances than the previous state-of-the-art.

[1]  Fahiem Bacchus,et al.  Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.

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

[3]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[4]  Armin Biere,et al.  Resolve and Expand , 2004, SAT.

[5]  Ofer Strichman,et al.  Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.

[6]  Armin Biere,et al.  Nenofex: Expanding NNF for QBF Solving , 2008, SAT.

[7]  Christoph Scholl,et al.  An AIG-based QBF-solver using SAT for preprocessing , 2010, Design Automation Conference.

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

[9]  Daniel Le Berre Exploiting the real power of unit propagation lookahead , 2001, Electron. Notes Discret. Math..

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

[11]  Inês Lynce,et al.  The Seventh QBF Solvers Evaluation (QBFEVAL'10) , 2010, SAT.

[12]  Frédéric Benhamou Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings , 2006, CP.

[13]  Armin Biere,et al.  Covered Clause Elimination , 2010, LPAR short papers.

[14]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

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

[16]  A. Slisenko Studies in constructive mathematics and mathematical logic , 1969 .

[17]  Oliver Kullmann,et al.  On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

[18]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[19]  Armin Biere,et al.  Blocked Clause Elimination , 2010, TACAS.

[20]  Lakhdar Sais,et al.  Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.

[21]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[22]  Armin Biere,et al.  Clause Elimination Procedures for CNF Formulas , 2010, LPAR.

[23]  Andreas G. Veneris,et al.  Leveraging dominators for preprocessing QBF , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).

[24]  Hans Kleine Büning,et al.  Bounded Universal Expansion for Preprocessing QBF , 2007, SAT.

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

[26]  Fahiem Bacchus,et al.  Preprocessing QBF , 2006, CP.

[27]  Hans Kleine Büning,et al.  Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings , 2008, SAT.

[28]  Enrico Giunchiglia,et al.  QuBE7.0 , 2010, J. Satisf. Boolean Model. Comput..

[29]  Joao Marques-Silva,et al.  Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings , 2007, SAT.

[30]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..