Skip to main content
SpringerLink
Log in

A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs

  • Conference paper
  • First Online:
Book cover Logic Programming and Automated Reasoning (LPAR 1994)

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

  • 125 Accesses

Abstract

In his paper [12] Ross extends the well-founded semantics for normal logic programs [16] to disjunctive logic programs. His definition is top-down and it is closer to a procedural semantics than to the elegant fixpoint definition of the well-founded semantics for normal logic programs. In the present paper, we propose a declarative, bottom-up fixpoint definition of the well-founded semantics for disjunctive logic programs. Our construction of the greatest unfounded set of extended literals is similar with the construction of the greatest unfounded set for normal programs. As a consequence, the connection between the well-founded semantics for normal programs and the well-founded semantics for disjunctive programs is made clearer.

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. R. 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–104, Los Altos, Ca, 1988. Morgan Kaufmann.

    Google Scholar 

  2. F. Fages. A New Fixpoint Semantics for General Logic Programs Compared with the Well-Founded and the Stable Model Semantics. In D. H. D. Warren and P. Szeredi, editors, Seventh International Conference on Logic Programming, 1990, pages 442–458.

    Google Scholar 

  3. M. Gelfond and V. Lifschitz. The Stable Semantics of Normal Logic. Programs. In K. Bowen and R. A. Kowalski editors, Fifth International Conference on Logic Programming, 1988, MIT Press.

    Google Scholar 

  4. J. W. Lloyd. Foundations of Logic Programming, second edition, Springer-Verlag, 1987.

    Google Scholar 

  5. J. Minker. On Indefinite Databases and the closed world assumption. In Proc. Sixth Conference on Automated Deduction, pages 292–308. Springer-Verlag, 1982.

    Google Scholar 

  6. J. Minker and A. Rajasekar. Disjunctive Logic Programming. In Sixth International Conference on Logic Programming, 1989, MIT Press.

    Google Scholar 

  7. J. Minker, A. Rajasekar. Stratification Semantics For Normal Disjunctive Logic Programs. In E. Lusk, R. A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, 1989, MIT Press.

    Google Scholar 

  8. J. Minker and A. Rajasekar. A Fixpoint Semantics for Disjunctive Logic Programs. Journal of Logic Programming, 9:45–74, 1990.

    Google Scholar 

  9. T. 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, Los Altos, CA, 1988, Morgan Kaufmann.

    Google Scholar 

  10. T. Przymusinski. Three Value Stable Semantics For Disjunctive Logic Programs. In D. H. D. Warren and P. Szeredi, editors, Seventh International Conference on Logic Programming, 1990, pages 459–477, MIT Press.

    Google Scholar 

  11. T. Przymusinski. Stationary Semantics For Disjunctive Logic Programs. In S. Debray and M. Hermenegildo, editors, Proceedings of the North American Conference on Logic Programming, 1990, MIT Press.

    Google Scholar 

  12. K. A. Ross. The Well Founded Semantics for Disjunctive Logic Programs. In W. Kim, J.-M. Nicolas and S. Nishio, editors, Deductive and Object-Oriented Databases, pages 385–402, Elsevier Science Publishers B. V. (North-Holland), 1990.

    Google Scholar 

  13. K. A. Ross and R. Topor. Inferring Negative Information from Disjunctive Databases. Journal of Automated Reasoning, 4:397–424, 1988.

    Google Scholar 

  14. J. D. Ullman. Bottom-up Beats Top-down for Datalog. In Proceedings of the 8th ACM Symposium on Principles of Database Systems (1989), pages 140–149.

    Google Scholar 

  15. A. Van Gelder. The Alternating Fixpoint of Logic Programs with negation. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, Los Altos, CA, 1988, Morgan Kaufmann.

    Google Scholar 

  16. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The Well-Founded Semantics for General Logic Programs, JACM, 38, 3 (1991), pages 620–650.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, University “Al. I. Cuza”, R-6600, Iasi, Romania

    Cristian Papp

Authors
  1. Cristian Papp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Pfenning

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papp, C. (1994). A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs. In: Pfenning, F. (eds) Logic Programming and Automated Reasoning. LPAR 1994. Lecture Notes in Computer Science, vol 822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58216-9_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-58216-9_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48573-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation