A labelling approach for ideal and stage semantics

Argument and Computation 2 (1):1 - 21 (2011)
  Copy   BIBTEX

Abstract

In this document, we describe the concepts of ideal semantics and stage semantics for abstract argumentation in terms of argument labellings. The difference between the traditional extensions approach and the labelling approach is that where the former only identifies the sets of accepted arguments, the latter also identifies the rejected arguments as well as the arguments that are neither accepted nor rejected. So far, the labellings approach has been successfully applied to complete, grounded, preferred, stable and semi-stable semantics, as well as to the concept of admissibility. In the current paper, we continue this line of research by showing that ideal semantics and stage semantics can also be described in terms of argument labellings

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,316

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An argument game for stable semantics.Martin Caminada & Yining Wu - 2008 - Logic Journal of the IGPL 17 (1):77-90.
Logical limits of abstract argumentation frameworks.Leila Amgoud & Philippe Besnard - 2013 - Journal of Applied Non-Classical Logics 23 (3):229-267.
On searching explanatory argumentation graphs.Régis Riveret - 2020 - Journal of Applied Non-Classical Logics 30 (2):123-192.

Analytics

Added to PP
2011-02-17

Downloads
28 (#662,333)

6 months
7 (#584,995)

Historical graph of downloads
How can I increase my downloads?