Well-founded approximations of autoepistemic logic

  • Jürgen Kalinski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 727)


Autoepistemic Logic is used as a unifying principle for the introduction of stable states for disjunctive logic programs and programs with strong negation. But as stable states are a generalization of stable models, their computational complexity prevents them from being implemented in knowledge representation systems. It is therefore shown that the well-founded semantics for normal programs can be viewed as an approximate superset of all stable models. The same idea can also be applied to the other program classes, thus yielding efficient and semantically characterizable approximations of stable states. In each case the immediate consequence operator for the corresponding class of positive programs is combined with the Gelfoncl-Lifschitz transformation and semi-operationalizations are derived from structural observations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chitta R. Baral and V. S. Subrahmanian. Stable and extension class theory for logic programs and default logics. Journal of Automated Reasoning, 8:345–366, 1992.Google Scholar
  2. 2.
    Nuel D. Belnap. How a computer should think. In Gilbert Ryle, editor, Contemporary Aspects of Philosophy, pages 30–56. Oriel Press, 1976.Google Scholar
  3. 3.
    Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.Google Scholar
  4. 4.
    Jürgen Kalinski. Weak autoepistemic reasoning and well-founded semantics. In Proc. of the Workshop on Theoretical Foundations of Knowledge Representation and Reasoning (to be published), 1992.Google Scholar
  5. 5.
    H. A. Kautz and B. Selman. Hard problems for simple default logics. In Proc. of the 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 189–197. Morgan Kaufmann, 1989.Google Scholar
  6. 6.
    Robert A. Kowalski and Fariba Sadri. Logic programs with exceptions. In Proc. of the 7th Int. Conf. on Logic Programming, pages 598–613. MIT Press, 1990.Google Scholar
  7. 7.
    Jack Minker and Arcot Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9:45–74, 1990.Google Scholar
  8. 8.
    Robert C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(4):75–94, 1985.Google Scholar
  9. 9.
    L. M. Pereira, J. N. Aparfcio, and J. J. Alferes. Contradiction removal within well-founded semantics. In Proc. of the 1st Int. Workshop on Logic Programming and Non-monotonic Reasoning, pages 105–119. MIT Press, 1991.Google Scholar
  10. 10.
    L. M. Pereira, J. N. Aparício, and J. J. Alferes. Non-monotonic reasoning with well founded semantics. In Proc. of the 8th Int. Conf. on Logic Programming, pages 475–489. MIT Press, 1991.Google Scholar
  11. 11.
    Teodor C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.Google Scholar
  12. 12.
    Kenneth A. Ross. The well founded semantics for disjunctive logic programs. In Proc. of the 1st Int. Conf. on Deductive and Object-Oriented Databases, pages 385–402. North-Holland, 1990.Google Scholar
  13. 13.
    M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742, 1976.Google Scholar
  14. 14.
    A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.Google Scholar
  15. 15.
    Allen Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. of the 8th Symp. on Principles of Database Systems, pages 1–10, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jürgen Kalinski
    • 1
  1. 1.Institute of Computer Science IIIUniversity of BonnBonnGermany

Personalised recommendations