2005
DOI: 10.1007/11562931_26
|View full text |Cite
|
Sign up to set email alerts
|

A Well-Founded Semantics with Disjunction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(21 citation statements)
references
References 13 publications
0
21
0
Order By: Relevance
“…We note that this idea is not new. For example, many well-founded semantics for disjunctive logic programming take up this idea, resulting in a well-founded state (Baral, Lobo, and Minker 1992;Brass and Dix 1995;Alcântara, Damásio, and Pereira 2005). 2 Accordingly, we will be interested in a grounded state V ⊆ V 4 (At) that represents the minimal knowledge entailed by a cADF.…”
Section: Grounded Interpretations and The Grounded Statementioning
confidence: 99%
See 1 more Smart Citation
“…We note that this idea is not new. For example, many well-founded semantics for disjunctive logic programming take up this idea, resulting in a well-founded state (Baral, Lobo, and Minker 1992;Brass and Dix 1995;Alcântara, Damásio, and Pereira 2005). 2 Accordingly, we will be interested in a grounded state V ⊆ V 4 (At) that represents the minimal knowledge entailed by a cADF.…”
Section: Grounded Interpretations and The Grounded Statementioning
confidence: 99%
“…To the best of our knowledge, no generalizations of ADFs as we have suggested here have been proposed before. As a 2 Some semantics explicitly use the idea of a set of interpretations (Alcântara, Damásio, and Pereira 2005), whereas other semantics are phrased syntactically, as a a set of disjunctions (Baral, Lobo, and Minker 1992;Brass and Dix 1995), which is equivalent to a set of interpretations (Seipel, Minker, and Ruiz 1997).…”
Section: Related Workmentioning
confidence: 99%
“…As in the deterministic case, a bilattice structure is defined for the approximating operators. This is done by the following relation, known as Smyth order (Smyth 1976), which is used in the context of DLP in several works (e.g., (Fernández and Minker 1995;Alcântara, Damásio, and Pereira 2005)). Definition 8.…”
Section: Non-deterministic Operators and Approximationsmentioning
confidence: 99%
“…In this section we mention some examples that are useful for comparing the infinite-valued approach L min ∞ with other existing approaches to the semantics of disjunctive logic programs with negation, in particular, STATIC (of [8]), D-WFS (of [2,3]), WFDS (of [11]), WFS d of [1] and with PEL (of [4]). We observe in particular that L min ∞ differs from all these semantics.…”
Section: Related Approachesmentioning
confidence: 99%
“…allow one to derive the falsity of b. Consider now the following example borrowed from[1]:{(a ∨ b ←∼ b), (b ←∼ b)}. For this example, L min∞ yields the minimal model {(a, F 0 ), (b, 0)}.…”
mentioning
confidence: 99%