Skip to main content
Springer Nature Link
Log in

Two simple characterizations of well-founded semantics

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1992 (MFCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 629))

  • 137 Accesses

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. S. Bonnier, U. Nilsson, and T. Naslund. A Simple Fixed Point Characterization of Three-valued Stable Model Semantics. Research report, University of Linkoping, 1990.

    Google Scholar 

  3. F. Bry. Logic programming as constructivism: a formalization and its application to databases. In Proceedings of the Symposium on Principles of Database Systems, pages 34–50, ACM SIGACT-SIGMOD, 1989.

    Google Scholar 

  4. J. Dix. Classifying semantics of logic programs. 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 166–180, MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

  5. 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, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.

    Google Scholar 

  6. M. Gelfond, H. Przymusinska, and T. Przymusinski. On the relationship between circumscription and negation as failure. Journal of Artificial Intelligence, 38:75–94, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  7. H. A. Kautz and B. Selman. Hard problems for simple default logics. In R. Brachman, H. Leveque, and R. Reiter, editors, Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Canada, pages 189–197, Morgan Kaufmann, 1989.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. W. Marek and M. Truszczynski. Autoepistemic Logic. Research report, University of Kentucky, University of Kentucky, 1988.

    Google Scholar 

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

  12. T. C. Przymusinski. On the declarative semantics of stratified 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 

  13. T. C. Przymusinski. Every logic program has a natural stratification and an iterated fixed point model. In Proceedings of the Eighth Symposium on Principles of Database Systems, pages 11–21, ACM SIGACT-SIGMOD, 1989.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  15. 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, MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  17. T. C. Przymusinski. Well-founded completions of logic programs. In Proceedings of the Eigth International Logic Programming Conference, Paris, France, pages 726–744, Association for Logic Programming, MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

  18. T. C. Przymusinski and D. S. Warren. Well-founded Semantics: Theory and Implementation. Research report, UC Riverside and SUNY at Stony Brook, 1991. (in preparation).

    Google Scholar 

  19. A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proceedings of the Symposium on Principles of Database Systems, pages 1–10, ACM SIGACT-SIGMOD, 1989.

    Google Scholar 

  20. 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 Symp. on Logic Programming (1986), and Foundations of Deductive Databases and Logic Programming, J. Minker, ed., Morgan Kaufmann, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  21. 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 at Riverside, 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

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Przymusinski, T.C. (1992). Two simple characterizations of well-founded semantics. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47291-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics