Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Disjunctive logic programming and autoepistemic logic

  • Conference paper
  • First Online:
Logic Programming and Knowledge Representation (LPKR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1471))

  • 104 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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. 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.).

    Article  MATH  MathSciNet  Google Scholar 

  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.).

    Article  MATH  MathSciNet  Google Scholar 

  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. J. Dix and T. Eiter. Personal communication.

    Google Scholar 

  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. 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. A. Van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. JACM, 38:620–650, 1991.

    MATH  Google Scholar 

  10. M. Gelfond. On stratified autoepistemic theories. In Proceedings of AAAI-87, pages 207–211. Morgan Kaufmann Publishers, 1987.

    Google Scholar 

  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. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–386, 1991.

    MATH  Google Scholar 

  13. H. J. Levesque. All i know: A study in autoepistemic logic. AI, 42:263–309, 1990.

    MATH  MathSciNet  Google Scholar 

  14. Ft. C. Moore. Semantic considerations on non-monotonic logic. AI, 25:75–94, 1985.

    MATH  Google Scholar 

  15. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.

    Article  MATH  Google Scholar 

  16. T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 14:323–357, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  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. G. Schwarz. Bounding introspection in nonmonotonic reasoning. KR'92, pages 581–590, 1992.

    Google Scholar 

  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. 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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  22. L.-Y. Yuan and J.-H. You. Autoepistemic circumscription and logic programming. Journal of Automated Reasoning, 10:143–160, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  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. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Alberta, T6G 2H1, Edmonton, Canada

    Li -Yan Yuan, Jia -Huai You & Randy Goebel

Authors
  1. Li -Yan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia -Huai You
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Randy Goebel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dix Luís Moniz Pereira Teodor C. Przymusinski

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuan, L.Y., You, J.H., Goebel, R. (1998). Disjunctive logic programming and autoepistemic logic. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Logic Programming and Knowledge Representation. LPKR 1997. Lecture Notes in Computer Science, vol 1471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054791

Download citation

  • DOI: https://doi.org/10.1007/BFb0054791

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64958-8

  • Online ISBN: 978-3-540-49872-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation