The intractability of validity in logic programming and dynamic logic

  • Howard A. Blair
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 164)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AVE82]
    Apt, K. R., and M. H. Van Emden. "Contributions to the Theory of Logic Programming," JACM vol. 29,no 3, (July, 1982) pp. 841–862.Google Scholar
  2. [B80]
    Blair, H. A., The Recursion-theoretic Complexity of the Fixed-Point Semantics of Definite Sentences, Ph.D. thesis, Syracuse University, 1980.Google Scholar
  3. [B82]
    Blair, H. A., "The Undecidability of Two Completeness Notions for the "Negation as Failure" Rule in Logic Programming," Proceedings of the First International Logic Programming Conference, Marseille, 1982.Google Scholar
  4. [B83]
    Blair, H. A., "The Recursion-theoretic Complexity of the Semantics of Predicate Logic as a Programming Language," Information and Control. (to appear.)Google Scholar
  5. [C80]
    Clark, K. L., "Negation as Failure," Logic and Data Bases, Gallaire & Minker, eds., Plenum, New York, 1980, pp. 55–76.Google Scholar
  6. [CK73]
    Chang, C. C., and H. J. Keisler, Model Theory, North-Holland, Amsterdam, 1973.Google Scholar
  7. [Ha79]
    Harel, D., First-Order Dynamic Logic, Lecture Notes in Computer Science, no. 68, Springer-Verlag, New York, 1979.Google Scholar
  8. [He54]
    Henkin, L., "A Generalization of the Concept of ω-Consistency," Journal of Symbolic Logic, vol 19, no 3, (Sept. 1954) pp. 183–196.Google Scholar
  9. [H74]
    Hill, R. LUSH-Resolution and Its Completeness, DCL Memo 78, University of Edinburgh, 1974.Google Scholar
  10. [Hi78]
    Hinman, P. G. Recursion-theoretic Hierarchies, Springer-Verlag, Berlin, 1978.Google Scholar
  11. [JLL83]
    Jaffar, J., J-L. Lassez, and J. W. Lloyd, Completeness of the Negation as Failure Rule, Technical Report 83/1, The University of Melbourne, 1983.Google Scholar
  12. [K79a]
    Kowalski, R. A., "Algorithm = Logic + Control," CACM, vol 22, no 7, (July, 79) pp. 424–436.Google Scholar
  13. [K79b]
    Kowalski, R. A., Logic for Problem Solving, Elsevier North-Holland, New York, 1979.Google Scholar
  14. [LM83]
    Lassez, J-L., and M. J. Maher, Optimal Fixed Points of Logic Programs, Technical Report 83/4, The University of Melbourne, 1983.Google Scholar
  15. [L82]
    Lloyd, J. W., Foundations of Logic Programming, Technical Report 82/7 The University of Melbourne, 1982.Google Scholar
  16. [M76]
    Monk, J. D., Mathematical Logic, Springer-Verlag, New York, 1976.Google Scholar
  17. [MD83]
    Manders, K. L., and R. F. Daley, "The Complexity of the Validity Problem for Dynamic Logic," Information and Control. (to appear.)Google Scholar
  18. [O56]
    Orey, S., "On w-Consistency and Related Properties," Journal of Symbolic Logic, vol 21, no 3, (Sept. 1956) pp. 246–254.Google Scholar
  19. [R67]
    Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.Google Scholar
  20. [S67]
    Shoenfield, J. R., Mathematical Logic, Addison-Wesley, Reading, Mass., 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Howard A. Blair
    • 1
  1. 1.Iowa State UniversityUSA

Personalised recommendations