2005 Asian Network for Scientific Information On Multi-valued Semantics for Logic Programs.pdfVIP

Journal of Applied Sciences 5 1 : 18-23, 2005 ISSN 1607-8926 ? 2005 Asian Network for Scientific Information On Multi-valued Semantics for Logic Programs Victor Felea Faculty of Computer Science, University AL.I.Cuza Iasi, General Berthelot 16, Iasi, 6600, Romania Abstract: For a general program P, multi-valued interpretations and models are defined, considering a set of truth logic values and an undefined value. The program P may contain constant propositions, which are defined for each truth logic value. Two orderings between the set of all multi-valued interpretations are considered: one is Fitting ordering and the other is standard ordering. The semantics of type well-founded and of type stable for a program P are introduced. This study showed that the well-founded model is the least stable model with respect to Fitting ordering. Key words: Fixed points, stable models, well-founded models INTRODUCTION semantics extends well-founded semantics and Fitting semantics. The well-founded semantics has been introduced by This study defines a semantics of type well-founded Van Gelder et al.[1]. It is a 3-valued semantics. They use as and a stable semantics for the case multi-valued truth values true, false and “z” an unknown truth interpretations and points out a relationship between value . They have shown that if a logic program P has a them. 2-valued well-founded model, then this model is the unique stable model of P. Interpretations and models: Let P be a general logic The stable model semantics has been introduced by program in sense Gelder[1]. Let H be the Herbrand base Gelfond and Lifschitz[2] and by Bidoit and Froidevaux[3]. associated to P. We consider a total ordered set of truth Przymusinski[4] has introduced 3-valued stable models values L 0, v ,...,v ,1 , where, value 0 corresponds to n 1 n-1 as a generalization of 2-valued stable models. He also false, value 1 is for