| Abstract |
The International Competition on Computational Models of Argumentation (ICCMA) focuses on reasoning tasks in abstract argumentation frameworks. Submitted solvers are tested on a selected collection of benchmark instances, including artificially generated argumentation frameworks and some frameworks formalizing real-world problems. This paper presents the novelties introduced in the organization of the Third (2019) and Fourth (2021) editions of the competition. In particular, we proposed new tracks to competitors, one dedicated to dynamic solvers (i.e., solvers that incrementally compute solutions of frameworks obtained by incrementally modifying original ones) in ICCMA’19 and one dedicated to approximate algorithms in ICCMA’21. From the analysis of the results, we noticed that i) dynamic recomputation of solutions leads to significant performance improvements, ii) approximation provides much faster results with satisfactory accuracy, and iii) classical solvers improved with respect to previous editions, thus revealing advancement in state of the art. |
| Authors |
Stefano Bistarelli  , Lars Kotthoff  , Jean-Marie Lagniez , Emmanuel Lonca , Jean-Guy Mailly , Julien Rossit , Francesco Santini , Carlo Taticchi
|
| Journal Info |
IOS Press | Argument & Computation , pages: 1 - 73
|
| Publication Date |
4/23/2024 |
| ISSN |
1946-2174 |
Type |
article |
| Open Access |
gold
|
| DOI |
https://doi.org/10.3233/aac-230013 |
| Keywords |
Argumentation Frameworks (Score: 0.659665) , Dialectical Argumentation (Score: 0.595887) , Knowledge Representation (Score: 0.55614) , Nonmonotonic Reasoning (Score: 0.545217) , Description Logics (Score: 0.532774)
|
