Well Founded Semantics and Stable Semantics of Semi-Strict Programs
Françoise Gire · 1992
: 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. 1 Introduction It is now well-known that the introduction of negation in the conditional part of the rules of logic programs increases the expressive power of positive logic programs. However negation in logic programs raises major problems in the definition of the declarative semantics of such programs. Through the different approaches which have been proposed to solve this problem, two main directions have been used: the first one consists in defining some classes of programs whose declarative semantics can be well defined; such classes of programs are stratifiable programs ([1]), locally stratifiable programs ([11],[12]) and effectively stratifiable programs ([2],[3...