A Branching Heuristics for Quantified Renamable Horn Formulas

Many solvers have been designed for $\mathcal{QBF}$s, the validity problem for Quantified Boolean Formulas for the past few years. In this paper, we describe a new branching heuristics whose purpose is to promote renamable Horn formulas. This heuristics is based on Hebrard's algorithm for the recognition of such formulas. We present some experimental results obtained by our qbf solver Qbfl with the new branching heuristics and show how its performances are improved.

[1]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[2]  Moshe Y. Vardi,et al.  Optimizing a BDD-Based Modal Solver , 2003, CADE.

[3]  Sharad Malik,et al.  Towards a symmetric treatment of satisfaction and conflicts in QBF , 2002 .

[4]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

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

[6]  Peter Balsiger,et al.  A Benchmark Method for the Propositional Modal Logics K, KT, S4 , 2004, Journal of Automated Reasoning.

[7]  Jussi Rintanen,et al.  Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae , 2001, LPAR.

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

[9]  Armando Tacchella,et al.  Backjumping for Quantified Boolean Logic satisfiability , 2001, Artif. Intell..

[10]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[11]  Stefan Woltran,et al.  Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas , 2000, AAAI/IAAI.

[12]  Jinchang Wang,et al.  Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.

[13]  Ian P. Gent,et al.  Solving 2-CNF Quantified Boolean Formulae using Variable Assignment and Propagation , 2002 .

[14]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[15]  Stefan Woltran,et al.  Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems , 2002, JELIA.

[16]  Jussi Rintanen,et al.  Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.

[17]  Pierre Marquis,et al.  Propositional Logic and One-Stage Decision Making , 2000, International Conference on Principles of Knowledge Representation and Reasoning.

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

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

[20]  Ulrike Sattler,et al.  BDD-Based Decision Procedures for K , 2002, CADE.

[21]  Jean-Jacques Hébrard.  A Linear Algorithm for Renaming a Set of Clauses as a Horn Set , 1994, Theor. Comput. Sci..

[22]  Armando Tacchella,et al.  Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers , 2003, SAT.

[23]  Andrei Voronkov,et al.  Automated Deduction—CADE-18 , 2002, Lecture Notes in Computer Science.

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

[25]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

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

[27]  Jacques D. Fleuriot,et al.  IsaPlanner: A Prototype Proof Planner in Isabelle , 2003, CADE.

[28]  Lakhdar Sais,et al.  SAT based BDD solver for quantified Boolean formulas , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.