Abstract
We describe Qubos (QUantified BOolean Solver), a decision procedure for quantified Boolean logic. The procedure is based on non-clausal simplification techniques that reduce formulae to a propositional clausal form after which off-the-shelf satisfiability solvers can be employed. We show that there are domains exhibiting structure for which this procedure is very effective and we report on experimental results.
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
Abdelwaheb Ayari and David Basin. Bounded model construction for monadic second-order logics. In 12th International Conference on Computer-Aided Verification (CAV’00), number 1855 in LNCS. Springer-Verlag, 2000.
Abdelwaheb Ayari, David Basin, and Stefan Friedrich. Structural and behavioral modeling with monadic logics. In Rolf Drechsler and Bernd Becker, editors, The Twenty-Ninth IEEE International Symposium on Multiple-Valued Logic. IEEE Computer Society, Los Alamitos, Freiburg, Germany, May 1999.
Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In TACAS’99, volume 1579 of LNCS Springer, 1999.
Thierry Boy de la Tour. An optimality result for clause form translation. Journal of Symbolic Computation, 14(4), October 1992.
Hans Kleine Büning and Theodor Lettmann. Aussagenlogik: Deduktion und Algorithmen. B. G. Teubner, Stuttgart, 1994.
Marco Cadoli, Andrea Giovanardi, and Marco Schaerf. An algorithm to evaluate quantified Boolean formulae. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), July 26–30 1998.
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. Backjumping for quantified boolean logic satisfiability. In Proceedings of the 17th International Conference on Artificial Intelligence (IJCAI-01), August 4-10 2001.
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. QuBE: A system for deciding Quantified Boolean Formulas Satisfiability. In Proceedings of the International Joint Conference on Automated Reasoning (IJCAR’01), June 2001.
Jan Friso Groote and Joost P. Warners. The propositional formula checker Heer-Hugo. In Ian Gent, Hans van Maaren, and Toby Walsh, editors, SAT20000: Highlights of Satisfiability Research in the year 2000, Frontiers in Artificial Intelligence and Applications. Kluwer Academic, 2000.
Reinhold Letz. Advances in decision procedures for quantified boolean formulas. In Uwe Egly, Rainer Feldmann, and Hans Tompits, editors, Proceedings of QBF2001 workshop at IJCAR’01, June 2001.
Matthew Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC’01), June 2001.
Andreas Nonnengart and Christoph Weidenbach. Computing small clause normal forms. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 6. Elsevier Science B.V., 2001.
David Plaisted, Armin Biere, and Yunshan Zhu. A satisfiability procedure for quantified boolean formulae. Unpublished, 2001.
Jussi Rintanen. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research, 10, 1999.
Jussi Rintanen. Improvements to the evaluation of quantified boolean formulae. In Dean Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol2). Morgan Kaufmann Publishers, S.F., July 31-August 6 1999.
Jussi Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In R. Nieuwenhuis and A. Voronkov, editors, Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 2250 of LNCS. Springer-Verlag, Berlin, 2001.
Christoph Scholl and Bernd Becker. Checking equivalence for partial implementations. In Design Automation Conference, 2001.
Ofer Shtrichman. Tuning sat checkers for bounded model checking. In 12th International Conference on Computer-Aided Verification (CAV’00), number 1855 in LNCS. Springer-Verlag, 2000.
Gunnar Stålmarck. A system for determining propositional logic theorems by applying values and rules to triplets that are generated from a formula. Technical report, European Patent Nr. 0403 454 (1995), US Patent Nr. 5 276 897, Swedish Patent Nr. 467 076 (1989), 1989.
Poul Williams, Armin Biere, Edmund Clarke, and Anubhav Gupta. Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking. In Proceedings of CAV’00, number 1855 in LNCS. Springer-Verlag, 2000.
Ramin Zabih and David McAllester. A rearrangement search strategy for determining propositional satisfiability. In Tom M. Smith, Reid G.; Mitchell, editor, Proceedings of the 7th National Conference on Artificial Intelligence, St. Paul, MN, August 1988. Morgan Kaufmann.
Hantao Zhang. SATO: An efficient propositional prover. In CADE’97, volume 1249 of LNAI. Springer, 1997.
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
Ayari, A., Basin, D. (2002). Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers. In: Aagaard, M.D., O’Leary, J.W. (eds) Formal Methods in Computer-Aided Design. FMCAD 2002. Lecture Notes in Computer Science, vol 2517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36126-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-36126-X_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00116-4
Online ISBN: 978-3-540-36126-8
eBook Packages: Springer Book Archive