[agents] ICCMA 2019: Last call for benchmarks

[Francesco Santini]

Third International Competition on Computational Models of Argumentation (ICCMA'19)

                               Call for Benchmarks

                          http://iccma19.dmi.unipg.it <http://iccma19.dmi.unipg.it/>
==================================================================

Argumentation is a major topic in the study of Artificial Intelligence. In particular, the problem of solving certain reasoning tasks on Dung's abstract argumentation frameworks is central to many advanced argumentation systems. The fact that many of the problems to be solved are intractable requires efficient algorithms and solvers.

The Third International Competition on Computational Models of Argumentation (ICCMA'19) will be conducted in the first half of 2019; submitted solvers will compete on a selected collection of benchmark instances.

The main goals of the competition are to provide a forum for empirical comparison of solvers, to highlight challenges to the community, to propose new directions for research and to provide a core of common benchmark instances and a representation formalism that can aid in the comparison and evaluation of solvers. 

ICCMA'19 reasoning tasks are detailed in the Call for Solvers (see http://iccma19.dmi.unipg.it/calls/solvers.txt <http://iccma19.dmi.unipg.it/calls/solvers.txt>).

Challenging and representative benchmarks are essential to perform significant comparisons of solvers. We invite submissions of both real world benchmarks and benchmark generators to ensure a diverse benchmark set for the competition. In the case of (randomly) generated benchmarks we invite the submission of the generator instead of the instances. Submissions of real world benchmarks are most welcome no matter if they come directly from an application or if they have been obtained via a translation from another (argumentation) formalism.

The 2019 edition of ICCMA also includes four tracks dedicated to solvers working on dynamic frameworks. For this reason, we will collect also generators and benchmarks where each instance consists in an abstract framework (tgf or apx formatted file) and a separate file with a list of 15 modifications (at least) to the initial instance. Each one of such modifications consists of the addition or removal of a single attack: e.g., "+att(a,b)." or "-att(d,e)." (apx), or "+1 3" or "-4 2" (tgf). These files with modifications will have respectively .apxm and .tgfm extensions.

A selection of the submitted benchmark instances will be used to evaluate solvers at ICCMA'19, and it will be made available to the community after the event.

Organizers reserve the right to make this choice, which will also be based on a pre-selection of benchmarks instances, whose goal is to select only "meaningful" benchmark instances.

The input format is adapted from the last edition of the competition and detailed at http://iccma2019.dmi.unipg.it/SolverRequirements.pdf <http://iccma2019.dmi.unipg.it/SolverRequirements.pdf> (more details and examples can be found there).



Before 

*** February 1, 2019 ***

authors of benchmarks are expected to 

1) produce a 2-page paper describing their generator/benchmark (using the EasyChair style, https://easychair.org/publications/for_authors <https://easychair.org/publications/for_authors>) indicating all the authors, and submit it using the link https://easychair.org/conferences/?conf=iccma19 <https://easychair.org/conferences/?conf=iccma19>. Please check the "Benchmark/generator" button during submission.

2) provide an instance set (composed of a significant number of instances, e.g. 30) and/or an instance generator (either producing instances in apx or tgf, or both). Software needs to be submitted by using the iccma19 at gmail.com <mailto:iccma19 at gmail.com> email address (either directly or by using a Dropbox/GoogleDrive link).

Regarding the provided instances, an indication of which instances, either provided in an instance set, or generated with some given parameters of the generator, is expected to be "hard", or "easy", is welcome.



Contact
-------
iccma19 at gmail.com <mailto:iccma19 at gmail.com>

Participants or just interested people are welcome to subscribe to argumentationcompetition at inria.fr <mailto:argumentationcompetition at inria.fr>, by sending an email with header "subscribe argumentationcompetition <your first name> <your surname>” to sympa_inria at inria.fr <mailto:sympa_inria at inria.fr>, in order to receive information concerning future editions of ICCMA.


Organizers
----------
Stefano Bistarelli, Department of Mathematics and Computer Science, University of Perugia, Italy
Lars Kotthoff, Department of Computer Science, University of Wyoming, USA
Theofrastos Mantadelis, Department of Mathematics and Computer Science, University of Perugia, Italy
Francesco Santini, Department of Mathematics and Computer Science, University of Perugia, Italy
Carlo Taticchi, Gran Sasso Science Institute (GSSI), L'Aquila, Italy


The ICCMA steering committee:
---------------------------
Federico Cerutti, School of Computer Science & Informatics, Cardiff University, UK
Sarah A. Gaggl, Computational Logic Group, TU Dresden, Germany
Nir Oren, Department of Computing Science, University of Aberdeen, UK
Jean-Guy Mailly, LIPADE, Université Paris Descartes, France
Matthias Thimm, Institute for Web Science and Technologies, University of Koblenz-Landau, Germany
Mauro Vallati, School of Computing and Engineering, University of Huddersfield, UK
Serena Villata, WIMMICS Research Team, INRIA Sophia Antipolis, France



========================================
Dr. Francesco Santini (Assistant Professor)
Department of Mathematics and Computer Science
University of Perugia
Via Vanvitelli 1
06123 Perugia
Italy
http://www.dmi.unipg.it/francesco.santini <http://www.dmi.unipg.it/francesco.santini>
========================================







-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.cs.umbc.edu/pipermail/agents/attachments/20190124/05931b75/attachment-0001.html>