Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1987: CSL '87 pp 129–137Cite as

On the computational complexity of quantified Horn clauses

  • Conference paper
  • First Online:

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

Abstract

A polynomial time algorithm is presented for the evaluation problem for quantified propositional Horn clauses. This answers an open problem posed by Itai and Makowski in (IM 87).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt and M.H. van Emden, Contributions to the Theory of Logic Programming, J. ACM vol. 29, 1982, pp. 841–862.

    Google Scholar 

  2. B. Aspvall, M. F. Plass, R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Inf. Processing Letters, Vol. 8, 1979, pp. 121–123.

    Google Scholar 

  3. W.F. Dowling and J.H. Gallier, Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae, J Logic Programming, vol. 3, 1984, pp. 267–284.

    Google Scholar 

  4. J.H. Gallier and S. Raatz, HORNLOG: A Graph-Based Interpreter for General Horn Clauses, J. of Logic Programming vol 4, 1987, pp. 119–155.

    Google Scholar 

  5. M. R. Garey and D. S. Johnston, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Fransicao, 1979.

    Google Scholar 

  6. A. Itai and J. A. Makowsky, Unification as a complexity measure for logic programming, J. Logic Programming, vol. 4, 1987, pp. 105–117.

    Google Scholar 

  7. Th. J. Schäfer, The Complexity of Satisfiability Problems. Proc. 10 th. Ann. ACM STOCS 1978, pp. 216–226

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bonn, Germany

    Marek Karpinski

  2. Institut für angewandte Informatik und formale Beschreibungsverfahren, University of Karlsruhe, Germany

    Hans Kleine Büning

  3. Scientific Center of IBM Germany, Heidelberg

    Peter H. Schmitt

Authors
  1. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter H. Schmitt
    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

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Karpinski, M., Büning, H.K., Schmitt, P.H. (1988). On the computational complexity of quantified Horn clauses. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50241-8

  • Online ISBN: 978-3-540-45960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation