1995
DOI: 10.1007/bf00883931
|View full text |Cite
|
Sign up to set email alerts
|

A logic programming system for nonmonotonic reasoning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0
1

Year Published

1998
1998
2011
2011

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(37 citation statements)
references
References 35 publications
0
36
0
1
Order By: Relevance
“…The essential problem with the previous definition is that the negations of Equilibrium Logic [22] underlying Answer Set semantics [15] and extensions are ruled out by RIF-FLD semantics. The same happens to Well-founded Semantics with Explicit Negation and its extensions [2,1,12]. The reason is the same for all these semantics since the double negation law for default negation does not hold, as can be seen in Figures 3-6 (the truth-table for symmetric negation is −).…”
Section: T T T T T T T T T Df T T T T T T T T T III T T T T T T T T Tmentioning
confidence: 66%
See 1 more Smart Citation
“…The essential problem with the previous definition is that the negations of Equilibrium Logic [22] underlying Answer Set semantics [15] and extensions are ruled out by RIF-FLD semantics. The same happens to Well-founded Semantics with Explicit Negation and its extensions [2,1,12]. The reason is the same for all these semantics since the double negation law for default negation does not hold, as can be seen in Figures 3-6 (the truth-table for symmetric negation is −).…”
Section: T T T T T T T T T Df T T T T T T T T T III T T T T T T T T Tmentioning
confidence: 66%
“…It has been shown that the adoption of double negation law for the semantics of negation hinders the RIF intention of providing a sufficient general semantics capable of capturing in a natural way an interesting subset of existing semantics for rule-based systems, namely for extended logic programming under Answer Set Semantics [15] or Well-founded Semantics with Explicit Negation [3,2]. It is argued that the only natural condition to impose is anti-monotonicity of the negation symbol.…”
Section: Conclusion and Further Workmentioning
confidence: 99%
“…We use the definition of (Alferes et al 1995), because it is closer to our definition of argumentation semantics than the original definition of (Pereira and Alferes 1992).…”
Section: Well-founded Semantics With Explicit Negationmentioning
confidence: 99%
“…For the well-founded semantics with explicit negation, WFSX (Pereira and Alferes 1992;Alferes and Pereira 1996), there exists a scenario semantics (Alferes et al 1993) which is similar to an argumentation semantics. This semantics applies only to non-contradictory programs; to our knowledge, no argumentation semantics has yet been found equivalent to the paraconsistent well-founded semantics with explicit negation, WFSX p (Damásio 1996;Alferes et al 1995;Alferes and Pereira 1996). This paper makes the following contributions: we identify various notions of attack for extended logic programs.…”
Section: Introductionmentioning
confidence: 99%
“…The MWeb framework is constructed, compatible and based on Rule Interchange Format (RIF) guidelines fostering immediate integration with RDF [12]. MWeb provides two semantics designated MWebWFS and MWebAS with a solid theory based on the two major semantics of extended logic programming, respectively, Well-Founded Semantics with Explicit Negation [1] and Answer Sets [9]. A compiler of MWeb into XSB Prolog is available 4 making use of the tabling features to guarantee termination of recursive rules with negation.…”
Section: Introductionmentioning
confidence: 99%