DepQBF: A Dependency-Aware QBF Solver (System Description)

We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quantifier prefixes of QBFs in prenex conjunctive normal form (PCNF). DepQBF 0.1 was placed first in the main track of QBFEVAL’10 in a score-based ranking. We provide a general system overview and describe selected orthogonal features such as restarts and removal of learnt constraints.

[1]  Adnan Darwiche,et al.  A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.

[2]  Armin Biere,et al.  A Compact Representation for Syntactic Dependencies in QBFs , 2009, SAT.

[3]  Armando Tacchella,et al.  Watched Data Structures for QBF Solvers , 2003, SAT.

[4]  Ofer Strichman,et al.  HaifaSat: a SAT solver based on an Abstraction/Refinement model , 2008, J. Satisf. Boolean Model. Comput..

[5]  Marco Schaerf,et al.  An Algorithm to Evaluate Quantified Boolean Formulae , 1998, AAAI/IAAI.

[6]  Armin Biere,et al.  Automated Testing and Debugging of SAT and QBF Solvers , 2010, SAT.

[7]  Armando Tacchella,et al.  Learning for quantified boolean logic satisfiability , 2002, AAAI/IAAI.

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

[9]  Inês Lynce,et al.  Heuristic-Based Backtracking Relaxation for Propositional Satisfiability , 2005, Journal of Automated Reasoning.

[10]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[11]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

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

[13]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[14]  Armando Tacchella,et al.  Monotone Literals and Learning in QBF Reasoning , 2004, CP.

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

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

[17]  Marco Benedetti,et al.  Quantifier Trees for QBFs , 2005, SAT.

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

[19]  Armando Tacchella,et al.  Quantifier Structure in Search-Based Procedures for QBFs , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

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

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