A Kripke-Kleene logic over general logic programs

  • Vladimir Kuznetsov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 861)


We propose a logic for partial reasoning over all general logic programs in a certain first-order language L. We need such a logic to express statements like it is impossible that a ground atom is both true and false in any program. To construct this logic we start with Kleene's three-valued logic. Then we extend L to a metalanguage L* by including a new system of connectives. Basing upon Kripke's approach we introduce the notion of truth for formulas of L*. Comparison with classical logic and intuitionistic one is given. We prove that every intuitionistic theorem is true in our logic. We also show how classical tautologies are mapped onto true formulas.


Logic Programming Kleene's Logic Kripke Semantics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Apt, K.R., Blair, H., and Walker, A. Towards a theory of declarative knowledge. In J.Minker, ed. Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann, Sun Mateo, Calif., 1988, pp. 89–148.Google Scholar
  2. [2]
    Apt, K.R., Logic Programming. In: J. van Leeuwen, ed. Handbook of Theoretical Computer Science, Elsevier Science Publishers B.V., 1990, pp. 495–574.Google Scholar
  3. [3]
    Clark, K.L. Negation as Failure. In: H.Gallaire and J.Minker (eds.), Logic and Databases, Plenum, New York, 1978, pp. 293–322.Google Scholar
  4. [4]
    Fitting, M. A Kripke-Kleene Semantics for Logic Programs, J. Logic Prog., 2:295–312 (1985).Google Scholar
  5. [5]
    Gelfond, M., and Lifschitz, V. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (Seattle, Wash.). IEEE, New York, 1988, pp.1070–1080.Google Scholar
  6. [6]
    Kleene, S.C., Introduction to Metamathematics, Van Nostrand, New York, 1952.Google Scholar
  7. [7]
    Kripke, S.A. Semantical Analysis of Intuitionistic Logic I, In Formal Systems and Recursive Functions, Amsterdam, 1965, pp.92–129.Google Scholar
  8. [8]
    Kripke, S.A. Semantical Consideration on Model Logic. In L.Linsky, ed. Reference and Modality, Oxford University Press, London, pp.63–72, 1971.Google Scholar
  9. [9]
    Kunen, K. Negation in Logic Programming, J. Logic Prog., 4:289–308 (1987).Google Scholar
  10. [10]
    Kuznetsov, V. Negation as Exception. In B.Neumann, ed. Proceedings of the 10th European Conference on Artificial Intelligence (Vienna). John Wiley and Sons, 1992, pp.107–108.Google Scholar
  11. [11]
    Martin-Löf, P. Notes on Constructive Mathematics. Almqvist & Wiksell, Stockholm, 1970.Google Scholar
  12. [12]
    Przymusinski, T.C. On the declarative semantics of deductive databases and logic programs. In J.Minker, ed. Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann, Sun Mateo, Calif., 1988, pp. 193–216.Google Scholar
  13. [13]
    Przymusinski, T.C. The Well-Founded Semantics Coincides with the Three-Valued Stable Model Semantics, Fundamenta Informaticae, 13:445–464 (1990).Google Scholar
  14. [14]
    Smullyan, R.M. Theory of Formal Systems, revised edition, Princeton U.P., Princeton, 1961.Google Scholar
  15. [15]
    Van Gelder, A., Ross, K.A., and Schlipf J.S. The Well-Founded Semantics for General Logic Programs, J. ACM, 38:620–650 (1991).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Vladimir Kuznetsov
    • 1
  1. 1.Moscow Power InstituteMoscowRussia

Personalised recommendations