This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Blair, H. A., The Recursion-theoretic Complexity of the Fixed-Point Semantics of Definite Sentences, Ph.D. thesis, Syracuse University, 1980.
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.
Blair, H. A., "The Recursion-theoretic Complexity of the Semantics of Predicate Logic as a Programming Language," Information and Control. (to appear.)
Clark, K. L., "Negation as Failure," Logic and Data Bases, Gallaire & Minker, eds., Plenum, New York, 1980, pp. 55–76.
Chang, C. C., and H. J. Keisler, Model Theory, North-Holland, Amsterdam, 1973.
Harel, D., First-Order Dynamic Logic, Lecture Notes in Computer Science, no. 68, Springer-Verlag, New York, 1979.
Henkin, L., "A Generalization of the Concept of ω-Consistency," Journal of Symbolic Logic, vol 19, no 3, (Sept. 1954) pp. 183–196.
Hill, R. LUSH-Resolution and Its Completeness, DCL Memo 78, University of Edinburgh, 1974.
Hinman, P. G. Recursion-theoretic Hierarchies, Springer-Verlag, Berlin, 1978.
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.
Kowalski, R. A., "Algorithm = Logic + Control," CACM, vol 22, no 7, (July, 79) pp. 424–436.
Kowalski, R. A., Logic for Problem Solving, Elsevier North-Holland, New York, 1979.
Lassez, J-L., and M. J. Maher, Optimal Fixed Points of Logic Programs, Technical Report 83/4, The University of Melbourne, 1983.
Lloyd, J. W., Foundations of Logic Programming, Technical Report 82/7 The University of Melbourne, 1982.
Monk, J. D., Mathematical Logic, Springer-Verlag, New York, 1976.
Manders, K. L., and R. F. Daley, "The Complexity of the Validity Problem for Dynamic Logic," Information and Control. (to appear.)
Orey, S., "On w-Consistency and Related Properties," Journal of Symbolic Logic, vol 21, no 3, (Sept. 1956) pp. 246–254.
Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
Shoenfield, J. R., Mathematical Logic, Addison-Wesley, Reading, Mass., 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blair, H.A. (1984). The intractability of validity in logic programming and dynamic logic. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_355
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_355
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive