Advertisement

Logic programs and alternation

  • Petr Štěpánek
  • Olga Štěpánková
Session 1b: Theory And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)

Keywords

Logic Program Space Complexity Exponential Time Universal State Input Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1977.
    Chandra,A.K., Stockmeyer,L.J., Alternation, Proc.IEEE Symp. on Foundations of Comp.Sci., Providence, R.I.1977, pp. 95–99Google Scholar
  2. 1981.
    Chandra, A.K., Kozen, D.C., Stockmeyer, L.J., Alternation, JACM 28 (1981), pp.114–133Google Scholar
  3. 1984.
    Shapiro, E., Alternation and the Computational Complexity of Logic Programs, J.Logic Programming 1 (1984), pp. 19–33Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Petr Štěpánek
    • 1
  • Olga Štěpánková
    • 2
  1. 1.Department of Computer Science and Op. Res.Charles UniversityPraha 1Czechoslovakia
  2. 2.Institute of Computational Techniques ČVUTPraha 2Czechoslovakia

Personalised recommendations