@MISC{Gire_equivalenceof, author = {Françoise Gire}, title = {Equivalence of Well-Founded and Stable Semantics}, year = {} }

Bookmark

OpenURL

Abstract

We show that the well-founded semantics and the stable semantics are equivalent on the class of the order-consistent programs which is a strict super-class of the locally-stratified programs class and of the call-consistent programs class. (1) Université de Paris 1 90 rue de Tolbiac 75634 Paris cedex 13 FRANCE email: gire@litp.ibp.fr 2 1 Introduction This paper deals with the equivalence problem of two well-known semantics which have been proposed for general logic programs: the stable semantics ([8]) and the well-founded semantics ([15,2]). A general logic program is a set of rules that have both positive and negative subgoals. Given a logic program it is desirable to associate with it a Herbrand model that is the 'meaning of the program' or its 'declarative semantics'. Much work have been done ([1..15]) for defining the declarative semantics of logic programs. For positive logic programs (i.e. programs without negative subgoals) this semantics is well defined and is now standard:...