Conformant Planning as a Case Study of Incremental QBF Solving

We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving. We report on experiments with a workflow to incrementally encode a planning instance into a sequence of QBFs. To solve this sequence of successively constructed QBFs, we use our general-purpose incremental QBF solver DepQBF. Since the generated QBFs have many clauses and variables in common, our approach avoids redundancy both in the encoding phase and in the solving phase. Experimental results show that incremental QBF solving outperforms non-incremental QBF solving. Our results are the first empirical study of incremental QBF solving in the context of planning and motivate its use in other application domains.

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

[2]  Gilles Audemard,et al.  Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction , 2013, SAT.

[3]  Martina Seidl,et al.  Partial witnesses from preprocessed quantified Boolean formulas , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[4]  Mikolás Janota,et al.  On QBF Proofs and Preprocessing , 2013, LPAR.

[5]  Bernd Becker,et al.  Verification of partial designs using incremental QBF solving , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[6]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

[8]  Bernd Becker,et al.  Incremental QBF Preprocessing for Partial Design Verification - (Poster Presentation) , 2012, SAT.

[9]  Hector Geffner,et al.  Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..

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

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

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

[13]  Armin Biere,et al.  Resolution-Based Certificate Extraction for QBF - (Tool Presentation) , 2012, SAT.

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

[15]  Armin Biere,et al.  A Unified Proof System for QBF Preprocessing , 2014, IJCAR.

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

[17]  Ronen I. Brafman,et al.  Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..

[18]  Ofer Strichman,et al.  Ultimately Incremental SAT , 2014, SAT.

[19]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.

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

[21]  Fahiem Bacchus,et al.  A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas , 2011, IJCAI.

[22]  Jussi Rintanen,et al.  Asymptotically Optimal Encodings of Conformant Planning in QBF , 2007, AAAI.

[23]  Armin Biere,et al.  Factoring Out Assumptions to Speed Up MUS Extraction , 2013, SAT.

[24]  Florian Lonsing,et al.  Incremental QBF Solving , 2014, CP.

[25]  Bernd Becker,et al.  Incremental preprocessing methods for use in BMC , 2011, Formal Methods Syst. Des..

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

[27]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[28]  Marco Schaerf,et al.  An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.

[29]  Florian Lonsing,et al.  Incremental QBF Solving by DepQBF , 2014, ICMS.

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

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