Skip to main content
SpringerLink
Log in

Primal and Dual Encoding from Applications into Quantified Boolean Formulas

  • Conference paper
Principles and Practice of Constraint Programming (CP 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8124))

Abstract

Quantified Boolean Formulas (QBF) provide a good language for modeling many complex questions about deterministic systems, especially questions involving control of such systems and optimizing choices. However, translators typically have one set way to encode the description of a system and a property, or question about the system, often without distinguishing between the two. In many cases there are choices about encoding methods, and one method will be much easier for a particular solver. This paper shows how to encode a large class of problems into primal and dual versions with opposite answers, while avoiding the blow-up associated with a simple negation of the first encoding.

The main point is that these encodings require knowledge of the underlying application; they are not automatic translations on a QBF. Trying to divide an arbitrary QBF into a system part and a property part is actually co-NP-hard.

For proof of concept, primal and dual encodings were implemented for several problem families in QBFLIB. (The primal encodings were already in QBFLIB.) For leading publicly available QBF solvers, solving times often differed by factors over 100, between the primal and dual encoding of the same underlying problem. Therefore, running both encodings in parallel and stopping when one encoding is solved is an attractive strategy, even though CPU time on both processors is charged. For some families and some solvers, this strategy was significantly faster than running only the primal on all problems, or running only the dual on all problems. Implications for certificates are also discussed briefly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balabanov, V., Jiang, J.R.: Unified QBF certification and its applications. Formal Methods in System Design 41, 45–65 (2012)

    Article  Google Scholar 

  2. Benedetti, M.: Extracting certificates from quantified boolean formulas. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (2005)

    Google Scholar 

  3. Benedetti, M., Mangassarian, H.: QBF-based formal verification: Experience and perspectives. JSAT 5, 133–191 (2008)

    MathSciNet  Google Scholar 

  4. Biere, A., Lonsing, F., Seidl, M.: Blocked clause elimination for QBF. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 101–115. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Biere, A.: Resolve and expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59–70. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Giunchiglia, E., Narizzano, M., Tacchella, A.: Clause/term resolution and learning in the evaluation of quantified boolean formulas. JAIR 26, 371–416 (2006)

    MathSciNet  MATH  Google Scholar 

  7. Giunchiglia, E., Narizzano, M., Tacchella, A.: QBF reasoning on real-world instances. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 105–121. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Goultiaeva, A., Bacchus, F.: Exploiting QBF duality on a circuit representation. In: AAAI (2010)

    Google Scholar 

  9. Goultiaeva, A., Bacchus, F.: Recovering and utilizing partial duality in QBF. In: Järvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 83–99. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  10. Goultiaeva, A., Van Gelder, A., Bacchus, F.: A uniform approach for generating proofs and strategies for both true and false QBF formulas. In: Proc. IJCAI (2011)

    Google Scholar 

  11. Jussila, T., Biere, A., Sinz, C., Kroning, D., Wintersteiger, C.M.: A first step towards a unified proof checker for QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 201–214. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Jussila, T., Biere, A.: Compressing BMC encodings with QBF. Electr. Notes Theor. Comput. Sci. 174(3), 45–56 (2007)

    Article  Google Scholar 

  13. Kleine Büning, H., Karpinski, M., Flögel, A.: Resolution for quantified boolean formulas. Information and Computation 117, 12–18 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kleine Büning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press (1999)

    Google Scholar 

  15. Klieber, W., Sapra, S., Gao, S., Clarke, E.: A non-prenex, non-clausal QBF solver with game-state learning. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 128–142. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Kontchakov, R., Pulina, L., Sattler, U., Schneider, T., Selmer, P., Wolter, F., Zakharyaschev, M.: Minimal module extraction from DL-lite ontologies using QBF solvers. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 836–841 (2009)

    Google Scholar 

  17. Lonsing, F., Biere, A.: Integrating dependency schemes in search-based QBF solvers. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 158–171. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  18. Mangassarian, H., Veneris, A.G., Safarpour, S., Benedetti, M., Smith, D.: A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test. In: International Conference on Computer-Aided Design. pp. 240–245 (2007)

    Google Scholar 

  19. Marin, P., Miller, C., Lewis, M., Becker, B.: Verification of partial designs using incremental QBF solving. In: Proc. DATE (2012)

    Google Scholar 

  20. Narizzano, M., Peschiera, C., Pulina, L., Tacchella, A.: Evaluating and certifying QBFs: A comparison of state-of-the-art tools. AI Commun. 22(4), 191–210 (2009)

    MathSciNet  MATH  Google Scholar 

  21. Nurvitadhi, E.: SMV tutorial—part I (2009), http://www.cs.cmu.edu/-~emc/15817-f09/nurvitadhi.SMV-tutorial-part1.pdf

  22. Peschiera, C., Pulina, L., Tacchella, A., Bubeck, U., Kullmann, O., Lynce, I.: The seventh QBF solvers evaluation (QBFEVAL’10). In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 237–250. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  23. Pulina, L., Tacchella, A.: A structural approach to reasoning with quantified boolean formulas. In: IJCAI, pp. 596–602 (2009)

    Google Scholar 

  24. Sabharwal, A., Ansótegui, C., Gomes, C.P., Hart, J.W., Selman, B.: QBF modeling: Exploiting player symmetry for simplicity and efficiency. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 382–395. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Staber, S., Bloem, R.: Fault localization and correction with QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 355–368. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, USA

    Allen Van Gelder

Authors
  1. Allen Van Gelder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information and Communication Technology, KTH Royal Institute of Technology, P.O. Box Forum 120, 16440, Kista, Sweden

    Christian Schulte

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Gelder, A. (2013). Primal and Dual Encoding from Applications into Quantified Boolean Formulas. In: Schulte, C. (eds) Principles and Practice of Constraint Programming. CP 2013. Lecture Notes in Computer Science, vol 8124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40627-0_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40627-0_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40626-3

  • Online ISBN: 978-3-642-40627-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation