Enhanced Integration of QBF Solving Techniques

In this paper we present a novel QBF solving technique which is based on the integration of a search based (DPLL) and a rewriting based approach: While traversing the search space in a DPLL manner, we iteratively generate many sub-problems, which are handed over to the rewriting method one by one. Instead of just communicating back satisfiability results of the individual sub-problems, we collect as many constraints derived by the rewriting based solver as possible, and transfer them back to the search based solver. This allows not only to prune the current branch, but also to avoid the unnecessary traversal of search paths in different regions of the search tree. We also discuss heuristics to determine suitable switching points between these two methods. We present first promising results that underline the potential of our approach.

[1]  Malay K. Ganai,et al.  Circuit-based Boolean reasoning , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[2]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[3]  Joao Marques-Silva,et al.  The Impact of Branching Heuristics in Propositional Satisfiability Algorithms , 1999, EPIA.

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

[5]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

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

[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.  Towards a symmetric treatment of satisfaction and conflicts in QBF , 2002 .

[9]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean satisfiability solver , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[10]  Nachum Dershowitz,et al.  Bounded Model Checking with QBF , 2005, SAT.

[11]  Aarti Gupta,et al.  Integrating a Boolean satisfiability checker and BDDs for combinational equivalence checking , 1998, Proceedings Eleventh International Conference on VLSI Design.

[12]  Sharad Malik,et al.  Partition-based decision heuristics for image computation using SAT and BDDs , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[13]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[14]  Luca Pulina,et al.  Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas , 2009, FroCoS.

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

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

[17]  Luca Pulina,et al.  A Structural Approach to Reasoning with Quantified Boolean Formulas , 2009, IJCAI.

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

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

[20]  Luca Pulina,et al.  A self-adaptive multi-engine solver for quantified Boolean formulas , 2009, Constraints.

[21]  Bernd Becker,et al.  Integration of orthogonal QBF solving techniques , 2011, 2011 Design, Automation & Test in Europe.

[22]  Armin Biere,et al.  Integrating Dependency Schemes in Search-Based QBF Solvers , 2010, SAT.

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

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

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

[26]  Armando Tacchella,et al.  QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability , 2001, IJCAR.

[27]  Armin Biere,et al.  Compressing BMC Encodings with QBF , 2007, BMC@FLoC.

[28]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .