Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database Theory

ICDT 1992: Database Theory — ICDT '92 pp 261–275Cite as

Well founded semantics and stable semantics of semi-strict programs

  • Conference paper
  • First Online:

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

Abstract

In this paper we exhibit a condition on the syntax of the logic programs with negation, the semi-strictness property, which assures the equivalence of the well founded semantics and the stable semantics: so, for semi-strict programs the well founded model is total if and only if the program has an unique stable model.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt R. K., Blair H., Walker A., Towards a theory of Declarative Knowledge, Workshop on Foundations of Deductive Databases and Logic Programming (1986) 546–628.

    Google Scholar 

  2. Bidoit N., Froidevaux C., Negation by Default and Unstratifiable Logic Programs, Technical report n∘ 437, LRI, 1988.

    Google Scholar 

  3. Bidoit N., Negation in Rule Based Database Languages: a Survey, Theoretical Computer Science 78 (1991) 3–83

    Google Scholar 

  4. Delahaye J.P., Thibau V., Programming in three-valued Logic, Theoretical Computer Science 78 (1991) 189–216

    Google Scholar 

  5. Fitting M., A Kripke-Kleene semantics for logic programs, in: J. Logic Programming 4 (1985)295–312.

    Google Scholar 

  6. Gelfond M., Lifschitz V., The stable model semantics for logic programs, in: Proc. Internat. Conf. on Logic Programming (1988) 1070–1080.

    Google Scholar 

  7. Gire F., Modèles par défaut des programmes effectivement déterministes, in: Proc. Vlèmes Journées de Bases de Données avancées (1990) 71–89.

    Google Scholar 

  8. Kunen K., Signed Data Dependencies in Logic Programs, in: J. Logic Programming 7 (1989) 231–245.

    Google Scholar 

  9. Lloyd J.W., Foundation of Logic Programming, Springer, Berlin, 1987.

    Google Scholar 

  10. Papadimitriou C.H., Yannakakis M., Tie-Breaking semantics and structural totality, personally communicated draft accepted to PODS 1992.

    Google Scholar 

  11. Przymusinski T., On the Declarative Semantics of Deductive Databases and Logic Programs, in: Foundations of Deductive Databases and Logic Programming, J.Minker editor, Morgan Kaufmann publishers (1988) 193–216.

    Google Scholar 

  12. Przymusinski T., Perfect Model Semantics, in: Proc. Internat. Conf. on Logic Programming (1988) 1081–1096

    Google Scholar 

  13. Van Gelder A., Ross K., Schlipf J.S., Unfounded Sets and Well Founded Semantics for General Logic Programs, in: Symposium on Principles of Database Systems, ACM SIGACT-SIGMOD-SIGART (1988) 221–230.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Blaise Pascal-LITP, Université de Paris, 4 place Jussieu, 75252, Paris Cedex 05

    Françoise Gire

Authors
  1. Françoise Gire
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joachim Biskup Richard Hull

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gire, F. (1992). Well founded semantics and stable semantics of semi-strict programs. In: Biskup, J., Hull, R. (eds) Database Theory — ICDT '92. ICDT 1992. Lecture Notes in Computer Science, vol 646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56039-4_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-56039-4_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56039-5

  • Online ISBN: 978-3-540-47360-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation