Skip to main content
SpringerLink
Log in

Abstract Solvers for Quantified Boolean Formulas and their Applications

  • Conference paper
  • First Online:
AI*IA 2015 Advances in Artificial Intelligence (AI*IA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9336))

Included in the following conference series:

Abstract

Abstract solvers are a graph-based representation employed in many research areas, such as SAT, SMT and ASP, to model, analyze and compare search algorithms in place of pseudo-code-based representations. Such an uniform, formal way of presenting the solving algorithms proved effective for their understanding, for formalizing related formal properties and also for combining algorithms in order to design new solving procedures.

In this paper we present abstract solvers for Quantified Boolean Formulas (QBFs). They include a direct extension of the abstract solver describing the DPLL algorithm for SAT, and an alternative formulation inspired by the two-layers architecture employed for the analysis of disjunctive ASP solvers. We finally show how these abstract solvers can be directly employed for designing solving procedures for reasoning tasks which can be solved by means of reduction to a QBF.

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. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937–977 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barrett, C., Shikanian, I., Tinelli, C.: An abstract decision procedure for a theory of inductive data types. JSAT 3(1–2), 21–46 (2007)

    MathSciNet  MATH  Google Scholar 

  3. Lierler, Y.: Abstract answer set solvers with backjumping and learning. Theory and Practice of Logic Programming 11, 135–169 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lierler, Y., Truszczynski, M.: Transition systems for model generators - a unifying approach. Theory and Practice of Logic Programming 11(4–5), 629–646 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brochenin, R., Lierler, Y., Maratea, M.: Abstract disjunctive answer set solvers. In: Schaub, T., Friedrich, G., O’Sullivan, B. (eds.) Proc. of ECAI 2014, vol. 263. Frontiers in Artificial Intelligence and Applications, pp. 165–170. IOS Press (2014)

    Google Scholar 

  6. Lierler, Y.: Relating constraint answer set programming languages and algorithms. Artificial Intelligence 207, 1–22 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Giunchiglia, E., Marin, P., Narizzano, M.: Reasoning with quantified boolean formulas. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Volume 185 of FAIA, pp. 761–780. IOS Press (2009)

    Google Scholar 

  8. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394–397 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  9. Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified boolean formulas. In: Kautz, H.A., Porter, B.W. (eds.) Proc. of AAAI 2000, pp. 417–422, AAAI Press / The MIT Press (2000)

    Google Scholar 

  10. Arieli, O., Caminada, M.W.A.: A QBF-based formalization of abstract argumentation semantics. Journal of Applied Logic 11(2), 229–252 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Diller, M., Wallner, J.P., Woltran, S.: Reasoning in abstract dialectical frameworks using quantified boolean formulas. In: Parsons, S., Oren, N., Reed, C., Cerutti, F. (eds.) Proc. of COMMA 2014. Volume 266 of FAIA, pp. 241–252, IOS Press (2014)

    Google Scholar 

  12. Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: Mostow, J., Rich, C. (eds) Proc. of AAAI 1998, pp. 262–267, AAAI Press / The MIT Press (1998)

    Google Scholar 

  13. 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 

  14. Charwat, G., Dvořák, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Methods for Solving Reasoning Problems in Abstract Argumentation - A Survey. Artificial Intelligence 220, 28–63 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lierler, Y.: Abstract answer set solvers. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 377–391. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Cashmore, M., Fox, M., Giunchiglia, E.: Partially grounded planning as quantified boolean formula. In: Borrajo, D., Kambhampati, S., Oddi, A., Fratini, S. (eds.) Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, ICAPS 2013, AAAI (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIBRIS, University of Genova, Viale F. Causa 15, Genova, Italy

    Remi Brochenin & Marco Maratea

Authors
  1. Remi Brochenin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Maratea
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Remi Brochenin .

Editor information

Editors and Affiliations

  1. Dipartimento di Ingegneria,, Università di Ferrara,, Ferrara, Italy

    Marco Gavanelli

  2. Dipartimento di Ingegneria, Università di Ferrara, Ferrara, Italy

    Evelina Lamma

  3. Dep di Matem e Informatica, Universita di Ferrara, Ferrara, Italy

    Fabrizio Riguzzi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Brochenin, R., Maratea, M. (2015). Abstract Solvers for Quantified Boolean Formulas and their Applications. In: Gavanelli, M., Lamma, E., Riguzzi, F. (eds) AI*IA 2015 Advances in Artificial Intelligence. AI*IA 2015. Lecture Notes in Computer Science(), vol 9336. Springer, Cham. https://doi.org/10.1007/978-3-319-24309-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24309-2_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24308-5

  • Online ISBN: 978-3-319-24309-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation