<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">(Apologies if you received multiple copies of this Call for Solvers)<div class=""><br class=""></div><div class=""><div class="">======================================================================================</div><div class=""> Fourth International Competition on Computational Models of Argumentation (ICCMA'21)</div><div class=""> </div><div class=""> Call for Solvers</div><div class=""> </div><div class=""> <a href="http://argumentationcompetition.org/2021/index.html" class="">http://argumentationcompetition.org/2021/index.html</a></div><div class="">=====================================================================================</div><div class=""><br class=""></div><div class="">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 or in (logic-based) structured 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.</div><div class=""><br class=""></div><div class="">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.</div><div class=""><br class=""></div><div class="">After the success of ICCMA'15, ICCMA'17 and ICCMA'19 (<a href="http://argumentationcompetition.org" class="">http://argumentationcompetition.org</a>), the Fourth International Competition on Computational Models of Argumentation (ICCMA'21) will be conducted in the first half of 2021. ICCMA'21 will include reasoning tasks in abstract argumentation frameworks as well as (for the first time at ICCMA) structured argumentation (namely, Assumption-based Argumentation). Submitted solvers will be tested on a selected collection of benchmark instances (see Call for Benchmarks: <a href="http://argumentationcompetition.org/2021/calls.html" class="">http://argumentationcompetition.org/2021/calls.html</a>).</div><div class=""><br class=""></div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Solvers will be evaluated based on their performance in solving the following problems:</div><div class=""><br class=""></div><div class="">(SE) Given an abstract argumentation framework, determine some extension;</div><div class="">(CE) Given an abstract argumentation framework, determine the number of its extensions;</div><div class="">(DC) Given an abstract argumentation framework and some argument, decide whether the given argument is credulously inferred;</div><div class="">(DS) Given an abstract argumentation framework and some argument, decide whether the given argument is skeptically inferred.</div><div class=""><br class=""></div><div class="">The above computational problems are to be solved with respect to the following standard semantics:</div><div class=""><br class=""></div><div class="">(CO) Complete Semantics (SE, EE, DC, DS);</div><div class="">(PR) Preferred Semantics (SE, EE, DC, DS);</div><div class="">(ST) Stable Semantics (SE, EE, DC, DS);</div><div class="">(SST) Semi-stable Semantics (SE, EE, DC, DS);</div><div class="">(STG) Stage Semantics (SE, EE, DC, DS);</div><div class="">(ID) Ideal Semantics (only (SE) and (DS)).</div><div class=""><br class=""></div><div class="">A task is a problem under a semantics. All the tasks of a particular semantics constitute a single different sub-track. For single-status semantics (ID) only the problems SE and DS are considered (CE is trivial, and DC is equivalent to DS). Note that DC-CO and DC-PR are equivalent as well, but in order to allow the participation in the preferred track without implementing tasks on the complete semantics (or viceversa), we repeat the task. These six sub-tracks form a first track, dedicated static abstract argumentation.</div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">In addition, the track dedicated to dynamic abstract argumentation is made of three sub-tracks. This track is dedicated to the solution of problems over dynamic argumentation frameworks. In this case, a benchmark consists of an initial framework and an additional file storing a sequence of additions/deletions of attacks/arguments. This file will be provided through a simple text format, e.g., a sequence of "+att(a,b)." or "-att(d,e).". </div><div class=""><br class=""></div><div class="">The final output needs to report the solution for the initial framework and as many outputs as the number of changes. The three sub-tracks involve the following semantics, for the four problems (SE,CE,DC,DS).</div><div class=""><br class=""></div><div class="">(CO-D) Complete Semantics, where D stands for "dynamic";</div><div class="">(PR-D) Preferred Semantics;</div><div class="">(ST-D) Stable Semantics.</div><div class=""><br class=""></div><div class="">Besides the file with changes, we will also provide all the full frameworks (one for each change), in order to allow non-dynamic solvers to participate to these tracks as well. More info available at <a href="http://argumentationcompetition.org/2021/SolverRequirements.pdf" class="">http://argumentationcompetition.org/2021/SolverRequirements.pdf</a>.</div><div class=""><br class=""></div><div class="">ICCMA'21 also introduces two completely new kinds of tracks. The first one is dedicated to approximate algorithms. It also concerns abstract argumentation, and focuses on the problems (DS) and (DC) for the semantics (CO,PR,ST,SST,STG) and DS for ID. And finally, a new track for structured argumentation is made of three sub-tracks, corresponding to the problems (SE,CE,DC,DS) for the semantics (CO,PR,ST) of assumption-based argumentation frameworks.</div><div class=""><br class=""></div><div class="">Developers of solvers may decide to only provide support for a subset of the above (sub-)tracks (for a maximum of eleven tracks). For each (sub-)track we will provide a ranking of the performance of the submitted solvers. Awards go to the winners of (sub-)tracks. Detailed evaluation and ranking rules can be found at <a href="http://argumentationcompetition.org/2021/rules.html" class="">http://argumentationcompetition.org/2021/rules.html</a>.</div><div class=""><br class=""></div><div class="">Input and output format are adapted from the last edition and detailed at <a href="http://argumentationcompetition.org/2021/SolverRequirements.pdf" class="">http://argumentationcompetition.org/2021/SolverRequirements.pdf</a>.</div><div class=""><br class=""></div><div class="">The evaluation process will consist of two phases: after the registration phase, the competitors will be given a set of representative frameworks to test their solvers on their own machines. Then, authors will be allowed to submit the source code or binary file of their solver.</div><div class=""><br class=""></div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Registration</div><div class="">--------------------</div><div class="">The competitors first need to declare (by email, <a href="mailto:iccma2021@cril.fr" class="">iccma2021@cril.fr</a>) their interest to submit their solver and participate to the competition (by February 15th 2021). Registered competitors will receive a sample of the frameworks on which their solver will be tested (by the beginning of March). </div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Final Submission </div><div class="">--------------------</div><div class="">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.</div><div class="">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).</div><div class=""><br class=""></div><div class="">In order to confirm their participation, the competitors need to submit as well a solver description (2-4 pages). The Latex template is available at <a href="http://argumentationcompetition.org/2021/iccma2021-latex-template.tar.gz" class="">http://argumentationcompetition.org/2021/iccma2021-latex-template.tar.gz</a>.</div><div class=""><br class=""></div><div class="">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 at <a href="http://argumentationcompetition.org/2021/SolverRequirements.pdf" class="">http://argumentationcompetition.org/2021/SolverRequirements.pdf</a>), 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.</div><div class=""><br class=""></div><div class="">Both the paper and the solver must be submitted on <a href="http://iccma2021.cril.fr/" class="">http://iccma2021.cril.fr/</a>.</div><div class=""><br class=""></div><div class="">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.</div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Schedule</div><div class="">--------</div><div class="">The schedule of the competition activities is:</div><div class=""><br class=""></div><div class="">- Feb 15, 2021: Declaration of intent by participants</div><div class="">- Feb 15, 2021: Benchmark submission</div><div class="">- Mar 30, 2021: Solver submission</div><div class="">- Apr 15, 2021: System descriptions</div><div class="">- Aug, 2021: Presentation of results</div><div class=""><br class=""></div><div class=""><br class=""></div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Contact</div><div class="">-------</div><div class="">Main contact: <a href="mailto:iccma2021@cril.fr" class="">iccma2021@cril.fr</a></div><div class=""><br class=""></div><div class="">Submission website: <a href="http://iccma2021.cril.fr/" class="">http://iccma2021.cril.fr/</a></div><div class=""><br class=""></div><div class="">For up-to-date information: <a href="https://twitter.com/argcompetition" class="">https://twitter.com/argcompetition</a></div><div class=""><br class=""></div><div class="">Participants or just interested people are welcome to subscribe to <a href="mailto:argumentationcompetition@inria.fr" class="">argumentationcompetition@inria.fr</a>, by sending an email with header "subscribe argumentationcompetition <your first name> <your surname>” to <a href="mailto:sympa_inria@inria.fr" class="">sympa_inria@inria.fr</a>, in order to receive information concerning future editions of ICCMA.</div><div class=""><br class=""></div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Organizers</div><div class="">----------</div><div class="">Jean-Guy Mailly, LIPADE, University of Paris, France</div><div class="">Emmanuel Lonca, CRIL, University of Artois, France</div><div class="">Jean-Marie Lagniez, CRIL, University of Artois, France</div><div class="">Julien Rossit, LIPADE, University of Paris, France</div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">The ICCMA steering committee:</div><div class="">---------------------------</div><div class="">Sarah A. Gaggl, International Center for Computational Logic, TU Dresden, Germany</div><div class="">Nir Oren, Department of Computing Science, University of Aberdeen, UK</div><div class="">Jean-Guy Mailly, LIPADE, University of Paris, France</div><div class="">Federico Cerutti, Department of Information Engineering, University of Brescia, Italy</div><div class="">Matthias Thimm, Institute for Web Science and Technologies, University of Koblenz-Landau, Germany</div><div class="">Mauro Vallati, School of Computing and Engineering, University of Huddersfield, UK</div><div class="">Serena Villata, WIMMICS Research Team, INRIA Sophia Antipolis, France</div></div><div class=""><br class=""></div><div class=""><br class="">
<br class=""></div><br class=""><br class=""><div class="">
<span style="font-size: 11pt; font-family: "Lucida Sans Unicode", "Lucida Grande", sans-serif;" class=""><b class="">Jean-Guy Mailly</b></span><br class=""><span "="" style="font-size: 11pt; font-family: "Lucida Sans Unicode", "Lucida Grande", sans-serif;" class="">Maître de Conférences / Associate Professor<br class="">LIPADE, UFR Mathématiques et Informatique<br class="">45 rue des Saints-Pères<br class="">75006 Paris<span class="Apple-converted-space"> </span></span><br class=""><a href="https://u-paris.fr/" class=""><img src="https://www.univ-paris-diderot.fr/sites/default/files/communication/mail/LogoMailUP/Mail_LogoUP154x50.jpg" class=""></a><span class="Apple-converted-space"> </span><br class=""><br class=""><table style="border-collapse: collapse;" class=""><tbody class=""><tr class=""><td style="padding-right: 5px;" class=""><a href="https://www.facebook.com/univparis/" class=""><img src="https://www.univ-paris-diderot.fr/sites/default/files/communication/mail/LogoMailUP/Mail_FB_rouge.png" class=""></a></td><td style="padding-right: 5px;" class=""><a href="https://www.instagram.com/univ_paris/?hl=fr" class=""><img src="https://www.univ-paris-diderot.fr/sites/default/files/communication/mail/LogoMailUP/Mail_Insta_rouge.png" class=""></a></td><td style="padding-right: 5px;" class=""><a href="https://twitter.com/Univ_Paris" class=""><img src="https://www.univ-paris-diderot.fr/sites/default/files/communication/mail/LogoMailUP/Mail_Twt_rouge.png" class=""></a></td><td class=""><a href="https://www.youtube.com/channel/UC5WhlXe1I_eRCtEx7cj3ZKg?fbclid=IwAR1vwGdU3uTudr9xzGkiXoNdg0tlasAeDl2lkkTP-cyEP_snhPMfdU_Oc9w" class=""><img src="https://www.univ-paris-diderot.fr/sites/default/files/communication/mail/LogoMailUP/Mail_Yt_rouge.png" class=""></a></td></tr></tbody></table>
</div>
<br class=""></body></html>