Skip to main content

Logic programs and alternation

  • Session 1b: Theory And Complexity
  • Conference paper
  • First Online:
Third International Conference on Logic Programming (ICLP 1986)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chandra,A.K., Stockmeyer,L.J., Alternation, Proc.IEEE Symp. on Foundations of Comp.Sci., Providence, R.I.1977, pp. 95–99

    Google Scholar 

  2. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J., Alternation, JACM 28 (1981), pp.114–133

    Google Scholar 

  3. Shapiro, E., Alternation and the Computational Complexity of Logic Programs, J.Logic Programming 1 (1984), pp. 19–33

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Štěpánek, P., Štěpánková, O. (1986). Logic programs and alternation. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics