Nonclassical models for logic programs
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.
Unable to display preview. Download preview PDF.
- [Kr]Kriaučiukas V. Dynamic logics in a form of logic programs. Math. Logics and Appl. Vilnius, 1990. No. 6. P. 67–76. (in Russian)Google Scholar
- [Ha]Harel D. First-order dynamic logic. Lect.Notes Comp.Sci. Springer, 1979. V. 68.Google Scholar
- [Ko]Kowalski R.A. Predicate logic as a programming language. Proc. IFIP'74, Stockholm. North-Holland, 1974. P. 500–506.Google Scholar
- [AM]Abadi A., Manna Z. Temporal logic programming. J. Symbolic Computation. 1989. V. 8, No. 2. P. 277–295.Google Scholar
- [Mi]Milner R. A calculus for communicating systems. Lect.Notes Comp.Sci. Springer, 1980. V. 92.Google Scholar
- [Gr]Grabowski J. Unificational dynamic logic. Elektron. Inf.verarb.Kybern. EIK. 1986. V. 22, No. 5/6. P. 325–338.Google Scholar