Results 1  10
of
28
A rewriting method for WellFounded Semantics with Explicit Negation
 IN INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP’02)
, 2002
"... We present a modification of Brass et al's transformationbased method for the bottomup computation of wellfounded semantics (WFS), in order to cope with explicit negation, in the sense of Alferes and Pereira's WFSX semantics. This variation consists in the simple addition of two int ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a modification of Brass et al's transformationbased method for the bottomup computation of wellfounded semantics (WFS), in order to cope with explicit negation, in the sense of Alferes and Pereira's WFSX semantics. This variation consists in the simple addition of two
Well Founded Semantics for Logic Programs with Explicit Negation
 EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1992
"... The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised [11 ..."
Abstract

Cited by 130 (54 self)
 Add to MetaCart
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised
ThreeValued Semantics for Extended Logic Programs
"... In [4] , the semantics of monotonic (i.e. not free) extended logic programs (ELPs) has been rephrased in threevalued logic for two purposes: achieving tractable reasoning with incomplete information and understanding the relationships between the existing semantics and manyvalued logics. In th ..."
Abstract
 Add to MetaCart
and Schwartz's reflexive AEL) . Our framework highlights surprising similarities between previously unrelated formalisms, such as TMS's with dependency directed backtracking, the WFSX semantics by Alferes and Pereira, and reflexive AEL. Moreover, we obtain very interesting new semantics, which
Contradiction Removal Semantics with Explicit Negation
 KNOWLEDGE REPRESENTATION AND REASONING UNDER UNCERTAINTY, NUMBER 808 IN LNAI
, 1992
"... Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by that, in any model, whenever :a (the explicit negation of a) holds, then ¸a (the negation by default of a) also holds. When explicit negation is used contradiction may be present (e.g. a and :a bot ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by that, in any model, whenever :a (the explicit negation of a) holds, then ¸a (the negation by default of a) also holds. When explicit negation is used contradiction may be present (e.g. a and :a
Scenario Semantics of Extended Logic Programs
, 1993
"... We present a coherent, flexible, unifying, and intuitive framework for the study of explicit negation in logic programs, based on the notion of admissible scenaria and the "coherence principle". With this support we introduce, in a simple way, a proposed "ideal sceptical semantics&quo ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
", as well as its well founded counterpart. Another result is a less sceptical "complete scenaria semantics", and its proof of equivalence to the wellfounded semantics with explicit negation (WFSX). This has the added benefict of bridging complete scenaria to default theory via WFSX, defined
A Logic Programming System for Nonmonotonic Reasoning
 Journal of Automated Reasoning
, 1995
"... The evolution of Logic Programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of Logic Programming. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms. Th ..."
Abstract

Cited by 93 (44 self)
 Add to MetaCart
(WFSX) and prove its soundness and completeness. (Its soundness wrt. the answersets semantics is also shown.) Our choice of WFSX as the base semantics is justified by the structural properties it enjoys, which are paramount for topdown query evaluation. Of course, introducing explicit negation
Partial Models of Extended Generalized Logic Programs
, 1999
"... . In recent years there has been an increasing interest in extensions of the logic programming paradigm beyond the class of normal logic programs motivated by the need for a satisfactory respresentation and processing of knowledge. An important problem in this area is to find an adequate declara ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
] and generalizes the WFSXsemantics of [12]. The presented preference criterion defines a partial model of an extended generalized logic program as intended if it is generated by a stationary chain. The GWFSXsemantics is defined by the settheoretical intersection of all stationary generated models, and thus
A Paraconsistent Semantics With Contradiction Support Detection
"... We begin by motivating the use of paraconsistency and the detection of contradiction supported conclusions by recourse to examples. Next we overview WFSX p and present its embedding into WFS. We then address the problem of detecting contradiction support and relate it to WFSX p's intrinsic pr ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We begin by motivating the use of paraconsistency and the detection of contradiction supported conclusions by recourse to examples. Next we overview WFSX p and present its embedding into WFS. We then address the problem of detecting contradiction support and relate it to WFSX p's intrinsic
Partial Models of Extended Generalized Logic Programs
, 1999
"... . In recent years there has been an increasing interest in extensions of the logic programming paradigm beyond the class of normal logic programs motivated by the need for a satisfactory respresentation and processing of knowledge. An important problem in this area is to find an adequate declara ..."
Abstract
 Add to MetaCart
] and generalizes the WFSXsemantics of [12]. The presented preference criterion defines a partial model of an extended generalized logic program as intended if it is generated by a stationary chain. The GWFSXsemantics is defined by the settheoretical intersection of all stationary generated models, and thus
TopDown Query Evaluation for WellFounded Semantics With Explicit Negation
, 1994
"... In this paper we define a sound and complete topdown semantic tree characterization, that includes pruning rules, of the wellfounded semantics for programs extended with explicit negation (WFSX), and compare it to other related approaches. It is amenable to a simple implementation (in appendix), ..."
Abstract

Cited by 21 (13 self)
 Add to MetaCart
In this paper we define a sound and complete topdown semantic tree characterization, that includes pruning rules, of the wellfounded semantics for programs extended with explicit negation (WFSX), and compare it to other related approaches. It is amenable to a simple implementation (in appendix
Results 1  10
of
28