# Design and Results of ICCMA 2021

arXiv: https://arxiv.org/abs/2109.08884 · HTML: https://mlsanity.com/paper/2109.08884/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 21 references that are in the map.
- First posted on arXiv 18 Sep 2021.

## Builds on (most cited first, 4 of 4)

- [Design and Results of the Second International Competition on Computational Models of Argumentation](https://mlsanity.com/paper/1909.00621/) (2019)
- [Fudge: A light-weight solver for abstract argumentation based on SAT reductions](https://mlsanity.com/paper/2109.03106/) (2021)
- [The pyglaf argumentation reasoner (ICCMA2021)](https://mlsanity.com/paper/2109.03162/) (2021)
- [Aspartix-V21](https://mlsanity.com/paper/2109.03166/) (2021)

## Abstract (arXiv)

Since 2015, the International Competition on Computational Models of Argumentation (ICCMA) provides a systematic comparison of the different algorithms for solving some classical reasoning problems in the domain of abstract argumentation. This paper discusses the design of the Fourth International Competition on Computational Models of Argumentation. We describe the rules of the competition and the benchmark selection method that we used. After a brief presentation of the competitors, we give an overview of the results.