14 pages. Part of ICCMA 2021 proceedingsSince 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
This volume is a systematic, expansive presentation of the major achievements in the intersection be...
International audienceEvaluation of scientific contributions can be done in many different ways. For...
International audienceThe field of computational models of argument is emerging as an important aspe...
International audienceWe report on the First International Competition on Computational Models of Ar...
We give an overview of design and results of the Second International Competition on Computational M...
We review the First International Competition on Computational Models of Argumentation (ICCMA'15). T...
We review the First International Competition on Computational Models of Argumentation (ICMMA'15). T...
We review the First International Competition on Computational Models of Argumentation (ICMMA’15). T...
Argumentation, which has long been a topic of study in philosophy, has become a well-established asp...
The investigation of computational models of argument is a rich and fascinating interdisciplinary re...
Research into computational models of argument is a rich interdisciplinary field involving the study...
This document contains some supplementary notes to probo, the benchmark frame-work that is used for ...
In this paper we illustrate the design choices that led to the development of ArgSemSAT, the winner ...
In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solve...
We introduce probo, a general benchmark framework for comparing abstract argumentation solvers. prob...
This volume is a systematic, expansive presentation of the major achievements in the intersection be...
International audienceEvaluation of scientific contributions can be done in many different ways. For...
International audienceThe field of computational models of argument is emerging as an important aspe...
International audienceWe report on the First International Competition on Computational Models of Ar...
We give an overview of design and results of the Second International Competition on Computational M...
We review the First International Competition on Computational Models of Argumentation (ICCMA'15). T...
We review the First International Competition on Computational Models of Argumentation (ICMMA'15). T...
We review the First International Competition on Computational Models of Argumentation (ICMMA’15). T...
Argumentation, which has long been a topic of study in philosophy, has become a well-established asp...
The investigation of computational models of argument is a rich and fascinating interdisciplinary re...
Research into computational models of argument is a rich interdisciplinary field involving the study...
This document contains some supplementary notes to probo, the benchmark frame-work that is used for ...
In this paper we illustrate the design choices that led to the development of ArgSemSAT, the winner ...
In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solve...
We introduce probo, a general benchmark framework for comparing abstract argumentation solvers. prob...
This volume is a systematic, expansive presentation of the major achievements in the intersection be...
International audienceEvaluation of scientific contributions can be done in many different ways. For...
International audienceThe field of computational models of argument is emerging as an important aspe...