Design and Results of the Second International Competition on Computational Models of Argumentation

by   Sarah A. Gaggl, et al.

Argumentation is a major topic in the study of Artificial Intelligence. Since the first edition in 2015, advancements in solving (abstract) argumentation frameworks are assessed in competition events, similar to other closely related problem solving technologies. In this paper, we report about the design and results of the Second International Competition on Computational Models of Argumentation, which has been jointly organized by TU Dresden (Germany), TU Wien (Austria), and the University of Genova (Italy), in affiliation with the 2017 International Workshop on Theory and Applications of Formal Argumentation. This second edition maintains some of the design choices made in the first event, e.g. the I/O formats, the basic reasoning problems, and the organization into tasks and tracks. At the same time, it introduces significant novelties, e.g. three additional prominent semantics, and an instance selection stage for classifying instances according to their empirical hardness.



page 1

page 2

page 3

page 4


Design and Results of ICCMA 2021

Since 2015, the International Competition on Computational Models of Arg...

System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15)

This volume contains the system description of the 18 solvers submitted ...

Relations between assumption-based approaches in nonmonotonic logic and formal argumentation

In this paper we make a contribution to the unification of formal models...

Computational Argumentation and Cognition

This paper examines the interdisciplinary research question of how to in...

Fudge: A light-weight solver for abstract argumentation based on SAT reductions

We present Fudge, an abstract argumentation solver that tightly integrat...

Proceedings of the Second Summer School on Argumentation: Computational and Linguistic Perspectives (SSA'16)

This volume contains the thesis abstracts presented at the Second Summer...

Technical Note: Exploring Σ^P_2 / Π^P_2-hardness for Argumentation Problems with fixed distance to tractable classes

We study the complexity of reasoning in abstracts argumentation framewor...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.