Skip to main content
SpringerLink
Log in

Samantics of normal and disjunctive logic programs a unifying framework

  • Conference paper
  • First Online:
Non-Monotonic Extensions of Logic Programming (NMELP 1994)

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

Abstract

We introduce a simple uniform semantic framework that isomorphically contains major semantics proposed recently for normal, disjunctive and extended logic programs, including the perfect model, stable, well-founded, disjunctive stable, stationary and static semantics and many others. The existence of such a natural framework allows us to compare major proposed semantics, analyze their properties, provide simpler definitions and generate new semantics satisfying a specific set of conditions.

Partially supported by the National Science Foundation grant #IRI-9313061.

See e.g. [Dix92, LMR92, Prz94c] for more information.

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. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–142. Morgan Kaufmann, Los Altos, CA., 1988.

    Google Scholar 

  2. J. J. Alferes and L. M. Pereira. On logic program semantics with two kinds of negation. In K. Apt, editor, International Joint Conference and Symposium on Logic Programming, pages 574–588. MIT Press, 1992.

    Google Scholar 

  3. J. Alferes, L. Pereira, and T. C. Przymusinski. Strong and explicit negation in non-monotonic reasoning and logic programming. (In preparation.), University of Lisbon and University of California at Riverside, 1995.

    Google Scholar 

  4. 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-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83–91. Springer-Verlag, 1994.

    Google Scholar 

  5. Stefan Brass and Jürgen Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Leon Sterling, editor, Proceedings of the 12th Int. Conf. on Logic Programming, Tokyo. MIT, June 1995.

    Google Scholar 

  6. N. Bidoit and C. Froidevaux. General logical databases and programs: Default logic semantics and stratification. Journal of Information and Computation, pages 15–54, 1991.

    Google Scholar 

  7. Jürgen Dix. Classifying Semantics of Disjunctive Logic Programs. In K. Apt, editor, LOGIC PROGRAMMING: Proceedings of the 1992 Joint International Conference and Symposium, pages 798–812. MIT Press, November 1992.

    Google Scholar 

  8. M. Gelfond. On stratified autoepistemic theories. In Proceedings AAAI-87, pages 207–211, Los Altos, CA, 1987. American Association for Artificial Intelligence, Morgan Kaufmann.

    Google Scholar 

  9. M. Gelfond. Logic programming and reasoning with incomplete information. Technical report, University of Texas at El Paso, 1992.

    Google Scholar 

  10. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1070–1080, Cambridge, Mass., 1988. Association for Logic Programming, MIT Press.

    Google Scholar 

  11. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the Seventh International Logic Programming Conference, Jerusalem, Israel, pages 579–597, Cambridge, Mass., 1990. Association for Logic Programming, MIT Press.

    Google Scholar 

  12. Michael Gelfond, Halina Przymusinski, and Teodor C. Przymusinski. On the relationship between circumscription and negation as failure. Journal of Artificial Intelligence, 38(1):75–94, February 1989.

    Article  Google Scholar 

  13. V. Lifschitz. Computing circumscription. In Proceedings IJCAI-85, pages 121–127, Los Altos, CA, 1985. American Association for Artificial Intelligence, Morgan Kaufmann.

    Google Scholar 

  14. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, Massachusetts, 1992.

    Google Scholar 

  15. J. McCarthy. Circumscription — a form of non-monotonic reasoning. Journal of Artificial Intelligence, 13:27–39, 1980.

    Article  Google Scholar 

  16. J. Minker. On indefinite data bases and the closed world assumption. In Proc. 6-th Conference on Automated Deduction, pages 292–308, New York, 1982, Springer Verlag.

    Google Scholar 

  17. R.C. Moore. Semantic considerations on non-monotonic logic. Journal of Artificial Intelligence, 25:75–94, 1985.

    Article  Google Scholar 

  18. W. Marek and M. Truszczynski. Non-Monotonic Logic. Springer Verlag, 1994.

    Google Scholar 

  19. L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, European Conference on Artificial Intelligence, pages 102–106. John Wiley & Sons, 1992.

    Google Scholar 

  20. H. Przymusinska and T. C. Przymusinski. Semantic issues in deductive databases and logic programs. In R. Banerji, editor, Formal Techniques in Artificial Intelligence, pages 321–367. North-Holland, Amsterdam, 1990.

    Google Scholar 

  21. T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, Los Altos, CA., 1988.

    Google Scholar 

  22. T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445–464, 1990.

    Google Scholar 

  23. T. C. Przymusinski. Autoepistemic logics of closed beliefs and logic programming. In A. Nerode, W. Marek, and V.S. Subrahmanian, editors, Proceedings of the First International Workshop on Logic Programming and Non-monotonic Reasoning, Washington, D.C., July 1991, pages 3–20, Cambridge, Mass., 1991. MIT Press.

    Google Scholar 

  24. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing Journal, 9:401–424, 1991. (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs. Proceedings of the 7-th International Logic Programming Conference, Jerusalem, pages 459–477, 1990. MIT Press.).

    Google Scholar 

  25. T. C. Przymusinski. Stationary semantics for normal and disjunctive logic programs. In C. Delobel, M. Kifer, and Y. Masunaga, editors, Proceedings of the Second International Conference on Deductive and Object-Oriented Databases DOOD'91, pages 85–107, Munich, Germany, December 1991. Springer Verlag.

    Google Scholar 

  26. T. C. Przymusinski. Three-valued non-monotonic formalisms and semantics of logic programs. Journal of Artificial Intelligence, 49(1–3):309–343, January 1991. (Extended abstract appeared in: Three-valued nonmonotonic formalisms and logic programming. Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Canada, pages 341–348, Morgan Kaufmann, 1989.).

    Article  Google Scholar 

  27. T. C. Przymusinski. Autoepistemic logic of knowledge and beliefs. (In preparation), University of California at Riverside, 1994. (Extended abstract appeared in ‘A knowledge representation framework based on autoepistemic logic of minimal beliefs’ In Proceedings of the Twelfth National Conference on Artificial Intelligence, AAAI-94, Seattle, Washington, August 1994, pages 952–959, Los Altos, CA, 1994. American Association for Artificial Intelligence, Morgan Kaufmann.).

    Google Scholar 

  28. T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, Special Issue on Disjunctive Programs, 1994. (in print).

    Google Scholar 

  29. T. C. Przymusinski. Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence, 12:141–187, 1994.

    Article  Google Scholar 

  30. D. Pearce and G. Wagner. Reasoning with negative information I: Strong negation in logic programs. In L. Haaparanta, M. Kusch, and I. Niiniluoto, editors, Language, Knowledge and Intentionality, pages 430–453. Acta Philosophica Fennica 49, 1990.

    Google Scholar 

  31. A. Van Gelder. Negation as failure using tight derivations for general logic programs. Journal of Logic Programming, 6(1):109–133, 1989. Preliminary versions appeared in Third IEEE Symposium Logic Programming (1986), and Foundations of Deductive Databases and Logic Programming, J. Minker, ed., Morgan Kaufmann, 1988.

    Article  Google Scholar 

  32. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 1990. (to appear). Preliminary abstract appeared in Seventh ACM Symposium on Principles of Database Systems, March 1988, pp. 221–230.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, 92521, Riverside, CA, USA

    Teodor C. Przymusinski

Authors
  1. Teodor C. Przymusinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dix Louis Moniz Pereira Teodor C. Przymusinski

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Przymusinski, T.C. (1995). Samantics of normal and disjunctive logic programs a unifying framework. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1994. Lecture Notes in Computer Science, vol 927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030659

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59467-3

  • Online ISBN: 978-3-540-49272-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation