Disjunctive logic programming and autoepistemic logic

  • Li -Yan Yuan
  • Jia -Huai You
  • Randy Goebel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1471)


In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different types of negative introspection in autoepistemic reasoning present two different interpretations of default negation: consistency-based and minimal-model-based. We also observed that all logic program semantics fall into three semantical points of view: the skeptical, stable, and partial-stable. Based on these two observations, we classify disjunctive logic program semantics into six different categories, and discuss the relationships among various semantics.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. 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.MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    S. Brass and J. Dix. Stefan Brass and Jürgen Dix. A disjunctive semantics based on unfolding and bottom-up evaluation. In Bernd Wolfinger, editor, Innovationen bei Rechen-und Kommunikationssystemen, (IFIP '94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83–91, Berlin, 1994. Springer.Google Scholar
  3. 3.
    Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207–228, 1997. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pages 85–98, 1995. LNCS 928, Springer.).MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, 20(1):143–165, 1998. (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, pages 268–283, 1996. Springer, LNCS 1126.).MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Stefan Brass, Jürgen Dix, Ilkka NiemelÄ, and Teodor. C. Przymusinski. A Comparison of the Static and the Disjunctive Well-founded Semantics and its Implementation. In A. G. Cohn, L. K. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 74–85. San Francisco, CA, Morgan Kaufmann, May 1998. appeared also as TR 17/97, University of Koblenz.Google Scholar
  6. 6.
    J. Dix and T. Eiter. Personal communication.Google Scholar
  7. 7.
    P. M. Dung. Negations as hypotheses: An abductive foundation for logic programming. In Proceedings of the 8th ICLP, pages 3–17, 1991.Google Scholar
  8. 8.
    Thomas Eiter, Nicola Leone, and Domenico Sacc. The expressive power of partial models in disjunctive deductive databases. In Logic in Databases, pages 245–264, 1996.Google Scholar
  9. 9.
    A. Van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. JACM, 38:620–650, 1991.MATHGoogle Scholar
  10. 10.
    M. Gelfond. On stratified autoepistemic theories. In Proceedings of AAAI-87, pages 207–211. Morgan Kaufmann Publishers, 1987.Google Scholar
  11. 11.
    M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th ICLP, pages 1070–1080, 1988.Google Scholar
  12. 12.
    M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–386, 1991.MATHGoogle Scholar
  13. 13.
    H. J. Levesque. All i know: A study in autoepistemic logic. AI, 42:263–309, 1990.MATHMathSciNetGoogle Scholar
  14. 14.
    Ft. C. Moore. Semantic considerations on non-monotonic logic. AI, 25:75–94, 1985.MATHGoogle Scholar
  15. 15.
    T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.MATHCrossRefGoogle Scholar
  16. 16.
    T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 14:323–357, 1995.MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    D. Saccà and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proceedings of the 9th ACM PODS, pages 205–217, 1990.Google Scholar
  18. 18.
    G. Schwarz. Bounding introspection in nonmonotonic reasoning. KR'92, pages 581–590, 1992.Google Scholar
  19. 19.
    J.-H. You, X. Wang, and L.-Y. Yuan. Disjunctive logic programming as constrainted inferences. In Proc. of International Conference on Logic Programming, 1997.Google Scholar
  20. 20.
    J.-H. You and L.-Y. Yuan. A three-valued semantics of deductive databases and logic programs. Journal of Computer and System Sciences, 49:334–361, 1994. A preliminary version appears in the Proc. of the 9th ACM PODS, page 171–182, 1990.MATHMathSciNetCrossRefGoogle Scholar
  21. 21.
    J.-H. You and L.-Y. Yuan. On the equivalence of semantics for normal logic programs. Journal of Logic Programming, 22(3):209–219, 1995.MathSciNetCrossRefGoogle Scholar
  22. 22.
    L.-Y. Yuan and J.-H. You. Autoepistemic circumscription and logic programming. Journal of Automated Reasoning, 10:143–160, 1993.MATHMathSciNetCrossRefGoogle Scholar
  23. 23.
    L.-Y. Yuan and J.-H. You. On the extension of logic programming with negation though uniform proofs. In Proc. of the 3rd International Conference on Logic Programming and Nonmonotonic Reasoning, 1995.Google Scholar
  24. 24.
    L.-Y. Yuan and J.-H. You. An introspective logic of belief. In Proc. of the Workshop on Logic Programming and Knowledge Representation, ILPS'97, pages 157–170, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Li -Yan Yuan
    • 1
  • Jia -Huai You
    • 1
  • Randy Goebel
    • 1
  1. 1.Department of Computer ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations