Skip to main content
SpringerLink
Log in

Subclasses of quantified boolean formulas

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 533))

Included in the following conference series:

Abstract

Using the results of a former paper of two of the authors [KaKB 90], for certain subclasses of quantified Boolean formulas it is shown, that the evaluation problems for these classes are coNP-complete. These subclasses can be seen as extensions of Horn and 2-CNF formulas.

Further it is shown that the evaluation problem for quantified CNF formulas remains PSPACE-complete, even if at most one universal variable is allowed in each clause.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. O. Aanderaa, E. Börger: The Horn complexity of Boolean functions and Cook's problem, Proc. 5th Scand.Logic Symp. (Eds.B.Mayoh, F.Jensen), 1979, 231–256

    Google Scholar 

  2. B. Aspvall, M. F. Plass and R.E. Tarjan: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas, Information Processing Letters, Volume 8, number 3, 1978, 121–123

    Article  Google Scholar 

  3. W. F. Dowling and J. H. Gallier: Linear-Time Algorithms For Testing The Satisfiability Of Propositional Horn Formulae, J. of Logic Programming, 1984, 267–284

    Google Scholar 

  4. M. R. Garey and D. S: Johnson: Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freemann and Co., New York, 1979

    Google Scholar 

  5. A. Haken: The intractability of resolution, Theoret. Comput. Sci. 39, 1985, 297–308

    Article  Google Scholar 

  6. M.Karpinski, H.Kleine Büning: Resolution for Quantified Boolean Formulas, submitted for publication

    Google Scholar 

  7. M. Karpinski, H. Kleine Büning and P.H. Schmitt: On the computational complexity of quantified Horn clauses, Lecture Notes in Computer Science 329, Springer-Verlag, 1987, 129–137

    Google Scholar 

  8. L. J. Stockmeyer and A. R. Meyer: Word problems requiring exponential time, Proc. 5th Ann. ACM Symp. Theory of Computing, 1973, 1–9

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB 11-Praktische Informatik, Universität Duisburg, D 4100, Duisburg 1, Germany

    Andreas Flögel & Hans Kleine Büning

  2. Institut für Informatik, Universität Bonn, D 5300, Bonn, Germany

    Marek Karpinski

Authors
  1. Andreas Flögel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter Wolfgang Schönfeld

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flögel, A., Karpinski, M., Büning, H.K. (1991). Subclasses of quantified boolean formulas. In: Börger, E., Kleine Büning, H., Richter, M.M., Schönfeld, W. (eds) Computer Science Logic. CSL 1990. Lecture Notes in Computer Science, vol 533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54487-9_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-54487-9_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54487-6

  • Online ISBN: 978-3-540-38401-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation