Yes, no, maybe, I don’t know: Complexity and application of abstract argumentation with incomplete knowledge

Argument and Computation 13 (3):291-324 (2022)
  Copy   BIBTEX

Abstract

argumentation, as originally defined by Dung, is a model that allows the description of certain information about arguments and relationships between them: in an abstract argumentation framework, the agent knows for sure whether a given argument or attack exists. It means that the absence of an attack between two arguments can be interpreted as “we know that the first argument does not attack the second one”. But the question of uncertainty in abstract argumentation has received much attention in the last years. In this paper, we survey approaches that allow to express information like “There may be an attack between these arguments”. We describe the main models that incorporate qualitative uncertainty in abstract argumentation, as well as some applications of these models. We also highlight some open questions that deserve some attention in the future.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

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

Abstract Complexity Definition.Mariusz Stanowski - 2011 - Complicity: An International Journal of Complexity and Education (2).
Complexity: E-Special Introduction.Oliver Human - 2016 - Theory, Culture and Society 33 (7-8):421-440.
Is the Standard Definition of Knowledge Incomplete?Anguel S. Stefanov - 2016 - Croatian Journal of Philosophy (46):107-111.
Complexity and sustainability.Jennifer Wells - 2013 - New York: Routledge.
Elements for an Argumentative Method of Interpretation.María G. Navarro - 2010 - Rozenberg Quarterly. The Magazine 1 (1).

Analytics

Added to PP
2022-10-21

Downloads
13 (#1,041,239)

6 months
8 (#370,225)

Historical graph of downloads
How can I increase my downloads?