2013 | OriginalPaper | Buchkapitel
AFs with Necessities: Further Semantics and Labelling Characterization
verfasst von : Farid Nouioua
Erschienen in: Scalable Uncertainty Management
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The Argumentation Frameworks with Necessities (AFNs) proposed in [17] are a kind of bipolar AFs extending Dung AFs with a support relation having the particular meaning of necessity. This paper is a continuation of this work in two respects. First, we complete the acceptability semantics picture by defining the well-founded, the complete and the semi-stable semantics for AFNs. We show that the proposed semantics keep the same properties as those given for Dung AFs and represent proper generalizations of them (in absence of the necessity relation, the classical semantics are recovered). Then, we show how to generalize Caminada’s labelling algorithms in presence of a necessity relation to compute the extensions under the studied semantics for AFNs.