Skip to main content

Disjunctive logic programming and possible model semantics

  • Conference paper
  • First Online:
Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications (DAI 1997)

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

Included in the following conference series:

  • 113 Accesses

Abstract

We use Kripke structures of autoepistemic logic to classify various semantics for disjunctive logic programs with default negation. We have observed that nonmonotonic reasoning can be characterized by Kripke structures whose beliefs are justified. We also 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 further observed that all logic program semantics fall into three semantical points of view: the skeptical, stable, and partial-stable. Based on these 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

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. A disjunctive semantics based on unfolding and bottom-up evaluation. In Bernd Wofiner, editor, IFIP '94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83–91, 1994.

    Google Scholar 

  3. S. Brass, J. Dix, I. Niemela, and T. Przymusinski. A comparison of the static and the disjunctive well-founded semantics and its implementation. In Proc. of Knowledge Representation, 1998.

    Google Scholar 

  4. P. M. Dung. Negations as hypotheses: An abductive foundation for logic programming. In Proceedings of the 8th ICLP, pages 3–17, 1991.

    Google Scholar 

  5. T. Eiter, N. Leone, and D. Sacc. The expressive power of partial models in disjunctive deductive databases. In Logic in Databases, pages 245–264, 1996.

    Google Scholar 

  6. A. Van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. JACM, 38:620–650, 1991.

    MATH  Google Scholar 

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

    Google Scholar 

  8. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th ICLP, pages 1070–1080, 1988.

    Google Scholar 

  9. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–386, 1991.

    MATH  Google Scholar 

  10. J.Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319–379, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  11. Jaakko Hintikka. Knowledge and Belief: An introduction to the logic of the two notions. Cornell University Press, 1962.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

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

  17. J.-H. You, X. Wang, and L.-Y. Yuan. Disjunctive logic programming as constrained inferences. In Proc. of ICLP, 1997.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

  20. L.-Y. Yuan. Autoepistemic logic of first order and its expressive power. Journal of Automated Reasoning, 13(1):69–82, 1994.

    Article  MATH  MathSciNet  Google Scholar 

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

  22. L.-Y. Yuan and J.-H. You. On the extension of logic programming with negation though uniform proofs. In Proc. of LPNMR'95, LNAI Vol. 928, 1995.

    Google Scholar 

  23. L.-Y. Yuan and J.-H. You. An introspective logic of belief. In Proc. of the Workshop on LP&KR, ILPS'97, pages 157–170, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wayne Wobcke Maurice Pagnucco Chengqi Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuan, LY., You, JH., Goebel, R. (1998). Disjunctive logic programming and possible model semantics. In: Wobcke, W., Pagnucco, M., Zhang, C. (eds) Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications. DAI 1997. Lecture Notes in Computer Science, vol 1441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055020

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64769-0

  • Online ISBN: 978-3-540-68722-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics