Preprocessing Techniques for QBFs

In this paper we present sQueezeBF, an eective preprocessor for QBFs that combines various techniques for eliminating variables and/or clauses. In particular sQueezeBF combines (i) variable elimination by Q-resolution and equality reduction, and (ii) clause simplification via subsumption and self-subsumption resolution. The experimental analysis shows that sQueezeBF can produce significant reductions in the number of clauses and/or variables — up to the point that some instances are solved directly by sQueezeBF — and that it can significantly improve the eciency of a range of state-of-the-art QBF solvers — up to the point that some instances cannot be solved without sQueezeBF preprocessing.

[1]  David A. Basin,et al.  Bounded Model Construction for Monadic Second-Order Logics , 2000, CAV.

[2]  Dhiraj K. Pradhan,et al.  NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances , 2004, SAT.

[3]  Franz Baader.  Automated deduction - CADE-19 : 19th International Conference on Automated Deduction, Miami Beach, FL, USA, July 28-August 2, 2003 : proceedings , 2003 .

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

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

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

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

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

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

[10]  Franz Baader,et al.  Automated Deduction – CADE-19 , 2003, Lecture Notes in Computer Science.

[11]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[12]  Lintao Zhang.  On Subsumption Removal and On-the-Fly CNF Simplification , 2005, SAT.

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

[14]  Bernd Becker,et al.  Checking equivalence for partial implementations , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

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

[16]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

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

[18]  Burkhard Monien,et al.  A Distributed Algorithm to Evaluate Quantified Boolean Formulae , 2000, AAAI/IAAI.

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