Well founded semantics and stable semantics of semi-strict programs

  • Françoise Gire
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 646)


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.


Logic Program Dependency Graph Function Symbol Predicate Symbol Default Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [2]
    Bidoit N., Froidevaux C., Negation by Default and Unstratifiable Logic Programs, Technical report n∘ 437, LRI, 1988.Google Scholar
  3. [3]
    Bidoit N., Negation in Rule Based Database Languages: a Survey, Theoretical Computer Science 78 (1991) 3–83Google Scholar
  4. [4]
    Delahaye J.P., Thibau V., Programming in three-valued Logic, Theoretical Computer Science 78 (1991) 189–216Google Scholar
  5. [5]
    Fitting M., A Kripke-Kleene semantics for logic programs, in: J. Logic Programming 4 (1985)295–312.Google Scholar
  6. [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. [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. [8]
    Kunen K., Signed Data Dependencies in Logic Programs, in: J. Logic Programming 7 (1989) 231–245.Google Scholar
  9. [9]
    Lloyd J.W., Foundation of Logic Programming, Springer, Berlin, 1987.Google Scholar
  10. [10]
    Papadimitriou C.H., Yannakakis M., Tie-Breaking semantics and structural totality, personally communicated draft accepted to PODS 1992.Google Scholar
  11. [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. [12]
    Przymusinski T., Perfect Model Semantics, in: Proc. Internat. Conf. on Logic Programming (1988) 1081–1096Google Scholar
  13. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Françoise Gire
    • 1
  1. 1.Institut Blaise Pascal-LITPUniversité de ParisParis Cedex 05

Personalised recommendations