Abstract
We present some results on semantics for logic programs. We interpret logic programs in Kripke models. They connect the area of logic programming and that of nonclassical logics. New connectives are carried over dynamic logic to logic programs, resulting in so-called predicate programs. A wide class of predicate programs is shown to have the same meaning as formulas of dynamic logic with context-free programs. This allows to discuss the known problem of introducing the negation into logic programs in new light.
Preview
Unable to display preview. Download preview PDF.
References
Kriaučiukas V. Dynamic logics in a form of logic programs. Math. Logics and Appl. Vilnius, 1990. No. 6. P. 67–76. (in Russian)
Harel D. First-order dynamic logic. Lect.Notes Comp.Sci. Springer, 1979. V. 68.
Kowalski R.A. Predicate logic as a programming language. Proc. IFIP'74, Stockholm. North-Holland, 1974. P. 500–506.
Abadi A., Manna Z. Temporal logic programming. J. Symbolic Computation. 1989. V. 8, No. 2. P. 277–295.
Apt K.R., van Emden M.H. Contributions to the theory of logic programming. J. ACM. 1982. V. 29, No. 3. P. 841–862.
Milner R. A calculus for communicating systems. Lect.Notes Comp.Sci. Springer, 1980. V. 92.
Grabowski J. Unificational dynamic logic. Elektron. Inf.verarb.Kybern. EIK. 1986. V. 22, No. 5/6. P. 325–338.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriaučiukas, V. (1991). Nonclassical models for logic programs. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013529
Download citation
DOI: https://doi.org/10.1007/BFb0013529
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55033-4
Online ISBN: 978-3-540-46667-3
eBook Packages: Springer Book Archive