Abstract
In this paper, we describe a new framework for evaluating Quantified Boolean Formulas (QBF). The new framework is based on the Davis-Putnam (DPLL) search algorithm. In existing DPLL based QBF algorithms, the problem database is represented in Conjunctive Normal Form (CNF) as a set of clauses, implications are generated from these clauses, and backtracking in the search tree is chronological. In this work, we augment the basic DPLL algorithm with conflict driven learning as well as satisfiability directed implication and learning. In addition to the traditional clause database, we add a cube database to the data structure. We show that cubes can be used to generate satisfiability directed implications similar to conflict directed implications generated by the clauses. We show that in a QBF setting, conflicting leaves and satisfying leaves of the search tree both provide valuable information to the solver in a symmetric way. We have implemented our algorithm in the new QBF solver Quaffle. Experimental results show that for some test cases, satisfiability directed implication and learning significantly prunes the search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Rintanen. Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research, 10:323–352, 1999
M. Sheeran, S. Singh, G. Stälmark, Checking Safety Properties Using Induction and a SAT-Solver, in Proceedings of FMCAD, 2000
A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs, In Tools and Algorithms for the Analysis and Construction of Systems (TACAS), 1999
H. Kleine-Büning, M. Karpinski and A. Flögel. Resolution for quantified Boolean formulas. In Information and Computation, 117(1):12–18, 1995
D. A. Plaisted, A. Biere and Y. Zhu. A Satisfiability Procedure for Quantified Boolean Formulae, To appear in, Discrete Applied Mathematics
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. In Communications of the ACM, 5:394–397, 1962
M. Cadoli, M. Schaerf, A. Giovanardi and M. Giovanardi. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation, in Highlights of Satisfiability Research in the Year 2000, IOS Press, 2000
J. Rintanen, Improvements to the Evaluation of Quantified Boolean Formulae, in Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 1999
J. Rintanen, Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae, in International Conf. on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), 2001
E. Giunchiglia, M. Narizzano and A. Tacchella,. Qube: a system for Deciding Quantified Boolean Formulas Satisfiability,. In Proc. of International Joint Conf. on Automated Reasoning (IJCAR), 2001
E. Giunchiglia, M. Narizzano and A. Tacchella. Backjumping for Quantified Boolean Logic Satisfiability. In Proc. of International Joint Conf. on Artificial Intelligence (IJCAI), 2001
João P. Marques-Silva and Karem A. Sakallah, “GRASP: A Search Algorithm for Prepositional Satisfiability, In IEEE Transactions on Computers, vol. 48, 506–521, 1999
R. Bayard and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances, in Proc. of the 14th Nat. (US) Conf. on Artificial Intelligence (AAAI), 1997
H. Zhang. SATO: An efficient propositional prover, In Proc. of the International Conference on Automated Deduction, 1997
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Engineering an efficient SAT Solver, In Proceedings of the Design Automation Conference, 2001
L. Zhang, C. Madigan, M. Moskewicz, S. Malik, Efficient Conflict Driven Learning in a Boolean Satisfiability Solver, in Proc. of International Conference on Computer Aided Design (ICCAD), 2001
L. Zhang and S. Malik, Conflict Driven Learning in a Quantified Boolean Satisfiability Solver, Accepted for publication, International Conference on Computer Aided Design (ICCAD), 2002
G. Hachtel and F. Somenzi, Logic Sysntheiss and Verification Algorithms: Kluwer Academic Publishers, 1996
J. Rintanen’s benchmarks are at http://ww.informatik.uni-freiburg.de/~rintanen/qbfhtml
R. Letz, Lemma, Model Caching in Decision Procedures for Quantified Boolean Formulas, in Proc. International Conf. on Automated Reasoning with Analytic Tableaux and Related Methods, 2002
E. Giunchiglia, M. Narizzano and A. Tacchella, Learning for Quantified Boolean Logic Satisfiability, in Proc. of the 18th Nat. (US) Conf. on Artificial Intelligence (AAAI), 2002
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, L., Malik, S. (2002). Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive