ICCMA
International Competition on Computational Models of Argumentation
Home Competition 2015 Competition 2017 Competition 2019 Competition 2021 Rules Calls Participation Solvers Benchmarks Results Organization Competition 2023 Contact

Supported by

How to participate?

Registration

The competitors first need to declare their interest to submit their solver and participate to the competition (by February 1 2021). Registered competitors will receive a sample of the frameworks on which their solver will be tested (by the beginning of March).

Final Submission

Solvers must be submitted as a ZIP archive containing their source code and a build.sh shell script producing the solver binary from the source code (if needed). A README file must be present, explaining the material required by the solver (e.g. libraries), how to launch it against a problem, and other information that may be useful to build/execute your solver.
The experiments are intended to be held on machines equipped with Intel Xeon E5-2637 v4 CPUs and 128GB of RAM. These machines are operated by 64bits CentOS Linux release 7.3.1611 (Linux kernel version 3.10).

In order to confirm their participation, the competitors need to submit as well a solver description (2-4 pages). The Latex template and submission website will be communicated soon.

This paper also has to indicate the name and affiliations of each team member, the name of the solver, and the classical/dynamic tasks that the solver will be able to handle (a complete list can be found in the Solver Requirements), the system architecture, which features or functions the system provides, what design choices were made and what lessons were learned. In addition, the paper has to mandatorily report a link to the source code or binary file of the solver.

After the announcement of the results, we expect the authors of solvers to submit their solver description on arXiv. This will allow us to gather these papers (as well as the benchmarks descriptions) as ICCMA 2021 proceedings. More instructions will be provided at this moment.




Last updated 22.10.2019, Matthias Thimm | Terms