Stable classes and operator pairs for disjunctive programs

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


Baral and Subrahmanian introduced the notion of stable classes for normal logic programs. In contrast to stable models stable classes always exist and can be given a constructive characterization. We generalize the Baral-Subrahmanian approach to disjunctive programs and propose mf-stable classes for different functions mf. Such mf-stable classes always exist and are sound with respect to stable model semantics. Operationalizations for approximate but efficient query evaluation are defined in terms of three-valued interpretations and their relation with mf-stable classes is analyzed. Finally, analogous concepts are given for an approach based on states instead of models.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chitta Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. In LPNMR91 [8], pages 69–86.Google Scholar
  2. 2.
    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
  3. 3.
    Melvin Fitting. The family of stable models. Journal of Logic Programming, 17:197–225, 1993.Google Scholar
  4. 4.
    Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th Int. Conf. and Symp. on Logic Programming, pages 1070–1080. MIT Press, 1988.Google Scholar
  5. 5.
    Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.Google Scholar
  6. 6.
    Jürgen Kalinski. Weak Autoepistemic Reasoning — A Study in Autoepistemic Reasoning from a Logic Programming Perspective. PhD thesis, Universität Bonn, 1994.Google Scholar
  7. 7.
    Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.Google Scholar
  8. 8.
    Proc. of the 1st Int. Workshop on Logic Programming and Non-monotonic Reasoning. MIT Press, 1991.Google Scholar
  9. 9.
    Wiktor Marek and Miroslaw Truszczyński. Autoepistemic logic. Journal of the ACM, 38(3):588–619, 1991.Google Scholar
  10. 10.
    Wiktor Marek and Miroslaw Truszczyński. Computing intersection of autoepistemic expansions. In LPNMR91 [8], pages 37–50.Google Scholar
  11. 11.
    Jack Minker and Arcot Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9:45–74, 1990.Google Scholar
  12. 12.
    Robert C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(4):75–94, 1985.Google Scholar
  13. 13.
    Teodor C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Proc. of the 7th Int. Conf. on Logic Programming, pages 459–477. MIT Press, 1990.Google Scholar
  14. 14.
    Teodor C. Przymusinski. Autoepistemic logics of closed beliefs and logic programming. In LPNMR91 [8], pages 3–20.Google Scholar
  15. 15.
    Teodor C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.Google Scholar
  16. 16.
    K. A. Ross and R. W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4:397–424, 1988.Google Scholar
  17. 17.
    Dietmar Seipel. Non-monotonic reasoning based on minimal models and its efficient implementation. In Bernd Wolfmger, editor, Innovationen bei Rechen-und Kommunikationssystemen, GI-Fachgespräch: Disjunctive logic programming and disjunctive databases, pages 53–60. Springer, 1994.Google Scholar
  18. 18.
    Bart Selman and Henry Kautz. Knowledge compilation using Horn approximations. In Proc. of the 9th National Conf. on Artificial Intelligence, pages 904–909, 1991.Google Scholar
  19. 19.
    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
  20. 20.
    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
  21. 21.
    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 1995

Authors and Affiliations

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

Personalised recommendations