… In this section we briefly review WFSX semantics for logic programs extended with
explicit negation. For full details the reader is referred to [8]. WFSX follows from one basic "coherence" …

… way to assert negated information about the domain being represented. We study the
semantics of disjunctive programs that contain both explicit negation and negationby-default, …

… explicit negation is present in extended logic programs the LPwNF framework differs from
other frameworks for ELF and can not easily be transformed … [18] for the wellfounded semantics …

… [VGRS88a, Prz87, Mah88] by ensuring that the Herbrand universe contains infinitely
many constants which do not appear explicitly in the original program. In function-free …

… the well-founded semantics with explicit negation, WFSX, a semantics of logic programs
intro… We then contrast explicit negation with strong negation. Section 4 illustrates an application …

… For this reason, in this paper we have adopted the infinite-valued characterization of the
well-founded model which makes these stages more explicit. On the other hand, the three-…

… wellfounded model is demonstrated by defining a general notion of constructive semantics
for logic programs… of our approach to the well-founded semantics which should be the most …

… logic programs with negation as failure. The approach presented in this paper will be based
on extended logic programs with two types of negation… by the explicit preference information. …

… for the study of explicìt negation in logic programs, based on the … sceptical semantics", as
well as its wellfounded counterpart. … well-founded semantics for programs with explicit negation …

… In this paper, we propose a new semantic framework for disjunctive logic programming by …
and JJ Alferes, Well founded semantics for logic programs with explicit negation, in: European …