[en] An important approach to abstract argumentation is the labeling-based approach, in which one makes use of labelings that assign to each argument one of three labels: in, out or und. In this paper, we address the question, which of the twenty-seven functions from the set of labels to the set of labels can be represented by an argumentation framework. We prove that in preferred, complete and grounded semantics, eleven label functions can be represented in this way while sixteen label functions cannot be represented by any argumentation framework. We show how this analysis of label functions can be applied to prove an impossibility result: Argumentation frameworks extended with a certain kind of weak attack relation cannot be flattened to the standard Dung argumentation frameworks.
Disciplines :
Computer science
Author, co-author :
Cramer, Marcos
Dauphin, Jérémie ; University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
External co-authors :
yes
Language :
English
Title :
A First Approach to Argumentation Label Functions
Publication date :
2020
Event name :
Computational Models of Argument
Event date :
September 4 to 11, 2020
Main work title :
Computational Models of Argument - Proceedings of COMMA 2020, Perugia Italy, September 4-11, 2020
Publisher :
IOS Press
Collection name :
Frontiers in Artificial Intelligence and Applications
Pietro Baroni, Guido Boella, Federico Cerutti, Massimiliano Giacomin, Leendert Van Der Torre, and Serena Villata. On the input/output behavior of argumentation frameworks. Artificial Intelligence, 217:144-197, 2014.
Pietro Baroni, Martin Caminada, and Massimiliano Giacomin. An introduction to argumentation semantics. The Knowledge Engineering Review, 26(4):365-410, 2011.
Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, and Giovanni Guida. Afra: Argumentation framework with recursive attacks. International Journal of Approximate Reasoning, 52(1):19-37, 2011.
Pietro Baroni, Massimiliano Giacomin, and Giovanni Guida. SCC-recursiveness: a general schema for argumentation semantics. Artificial Intelligence, 168(1):162-210, 2005.
Ringo Baumann, Gerhard Brewka, and Markus Ulbricht. Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense. Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (2020), 2020.
Guido Boella, Dov M Gabbay, Leendert van der Torre, and Serena Villata. Meta-Argumentation modelling I: Methodology and techniques. Studia Logica, 93(2-3):297-355, 2009.
Guido Boella, Dov M Gabbay, Leendert WN van der Torre, and Serena Villata. Support in Abstract Argumentation. COMMA, 216:111-122, 2010.
Martin Caminada. Semi-stable semantics. In Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006, pages 121-130. IOS Press, 2006.
Claudette Cayrol and Marie-Christine Lagasquie-Schiex. On the acceptability of arguments in bipolar argumentation frameworks. In European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, pages 378-389. Springer, 2005.
Marcos Cramer and Jérémie Dauphin. Argumentation Label Functions-Technical Report. https://orbilu.uni.lu/bitstream/10993/43078/1/report.pdf. University of Luxembourg, 2020.
Marcos Cramer and Leendert van der Torre. SCF2-An argumentation semantics for rational human judgments on argument acceptability. Proceedings of the 8th Workshop on Dynamics of Knowledge and Belief (DKB-2019) and the 7th Workshop KI and Kognition (KIK-2019), 2019.
Phan Minh Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77(2):321-357, 1995.
Wolfgang Dvorák and Sarah Alice Gaggl. Stage semantics and the scc-recursive schema for argumentation semantics. Journal of Logic and Computation, 26(4):1149-1202, 2014.
Tjitze Rienstra, Alan Perotti, Serena Villata, Dov M Gabbay, and Leendert van der Torre. Multi-sorted argumentation. In International Workshop on Theorie and Applications of Formal Argumentation, pages 215-231. Springer, 2011.
Bart Verheij. Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages. In In Proceedings of the biannual International Conference on Formal and Applied Practical Reasoning (FAPR) workshop, pages 357-368. Universiteit, 1996.
