Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation

  • Florian Lonsing
  • Uwe Egly
  • Allen Van Gelder
Conference paper

DOI: 10.1007/978-3-642-39071-5_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7962)
Cite this paper as:
Lonsing F., Egly U., Van Gelder A. (2013) Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. In: Järvisalo M., Van Gelder A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg

Abstract

Recent solvers for quantified boolean formulas (QBF) use a clause learning method based on a procedure proposed by Giunchiglia et al. (JAIR 2006), which avoids creating tautological clauses. Recently, an exponential worst case for this procedure has been shown by Van Gelder (CP 2012). That paper introduced QBF Pseudo Unit Propagation (QPUP) for non-tautological clause learning in a limited setting and showed that its worst case is theoretically polynomial, although it might be impractical in a high-performance QBF solver, due to excessive time and space consumption. No implementation was reported.

We describe an enhanced version of QPUP learning that is practical to incorporate into high-performance QBF solvers, being compatible with pure-literal rules and dependency schemes. It can be used for proving in a concise format that a QBF formula is either unsatisfiable or satisfiable (working on both proofs in tandem). A lazy version of QPUP permits non-tautological clauses to be learned without actually carrying out resolutions, but this version is unable to produce proofs.

Experimental results show that QPUP is somewhat faster than the previous non-tautological clause learning procedure on benchmarks from QBFEVAL-12-SR.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Florian Lonsing
    • 1
  • Uwe Egly
    • 1
  • Allen Van Gelder
    • 2
  1. 1.Technische Universität WienAustria
  2. 2.University of CaliforniaSanta CruzUSA

Personalised recommendations