<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=""><div class="">[Apologies if you receive multiple copies. Please forward this call to interested parties.]</div><div class="">===========================================================================================</div><div class="">Call for Papers</div><div class="">===========================================================================================</div><div class="">SAFA2022</div><div class="">The Fourth International Workshop on Systems and Algorithms for Formal Argumentation</div><div class=""><br class=""></div><div class=""><a href="http://safa2022.argumentationcompetition.org" class="">http://safa2022.argumentationcompetition.org</a></div><div class=""><br class=""></div><div class="">Co-located with the Ninth International Conference on Computational Models of Argument (COMMA'22), Cardiff, Wales, United Kingdom (<a href="https://comma22.cs.cf.ac.uk" class="">https://comma22.cs.cf.ac.uk</a>).</div><div class=""><br class=""></div><div class="">September 12/13, 2022</div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Description</div><div class="">===========================================================================================</div><div class="">Computational models of argumentation are approaches that deal with the representation and</div><div class="">interaction of arguments and counterarguments. These models can be applied in all areas</div><div class="">that benefit from automatic decision-support such as medicine, accounting, chemistry, and</div><div class="">law. Many of these models were inspired by works within the fields of non-monotonic</div><div class="">reasoning and logic programming and therefore share the sometimes considerable</div><div class="">computational complexity of these approaches.</div><div class=""><br class=""></div><div class="">Algorithmic aspects of computational models of argumentation are an important area, as</div><div class="">witnessed by the popularity of the International Competition on Computational Models of</div><div class="">Argumentation (ICCMA). This workshop aims at complementing the competition by providing a</div><div class="">forum to present and discuss both systems and algorithms dealing with all aspects of</div><div class="">computational argumentation, in particular those approaches addressing the tracks of the</div><div class="">competition. A first workshop had been organised in 2016, a second one in 2018 and a third one in 2020.</div><div class=""><br class=""></div><div class="">This workshop welcomes technical contributions in all areas dealing with algorithms and systems of formal argument. Topics of interest include, but are not limited to:</div><div class=""><br class=""></div><div class="">* Algorithms for solving problems in abstract argumentation frameworks</div><div class="">* Algorithms for solving problems in structured argumentation frameworks (such as ASPIC+,</div><div class=""> ABA, DeLP, and others)</div><div class="">* Computational complexity of problems in formal argumentation</div><div class="">* Advanced techniques that may be exploited for algorithmic purposes</div><div class="">* Parallel algorithms</div><div class="">* Approximation algorithms</div><div class="">* Web-based systems and argument mining</div><div class="">* Dialogue systems and strategic aspects of argumentation</div><div class="">* Machine learning and argumentation</div><div class="">* Design principles and software engineering aspects of tools for formal argumentation</div><div class="">* Metrics for evaluating algorithms</div><div class="">* Benchmark generation and empirical studies on real-world argumentation graphs</div><div class="">* System descriptions of tools for formal argumentation</div><div class=""><br class=""></div><div class="">The workshop specifically welcomes preliminary works on the above topics. In particular, no systematic evaluations are needed for inclusion in the program. Finally, we welcome position papers that propose new tracks for the competition or discuss general matters related to it.</div><div class=""><br class=""></div><div class="">Keynote Speaker</div><div class="">===========================================================================================</div><div class="">Johannes K. Fichte (TU Wien)</div><div class=""><br class=""></div><div class="">Important Dates</div><div class="">===========================================================================================</div><div class="">Paper submission deadline: <span class="Apple-tab-span" style="white-space:pre"> </span>Jul 8, 2022</div><div class="">Notification of acceptance:<span class="Apple-tab-span" style="white-space:pre"> </span>Aug 9, 2020</div><div class="">Camera-ready version:<span class="Apple-tab-span" style="white-space:pre"> </span> Aug 30, 2020</div><div class="">Workshop:<span class="Apple-tab-span" style="white-space:pre"> </span> Sep 12/13, 2020</div><div class=""><br class=""></div><div class=""><br class=""></div><div class="">Submission</div><div class="">===========================================================================================</div><div class="">We invite papers, which have to be in English and formatted according to the IOS style (<a href="http://www.iospress.nl/service/authors/latex-and-word-tools-for-book-authors/" class="">http://www.iospress.nl/service/authors/latex-and-word-tools-for-book-authors/</a>), in the following two categories:</div><div class=""><br class=""></div><div class="">* Full technical papers (12 pages max., including references) are expected to report on new research that makes a substantial technical contribution to the field. Additional details may be included in an appendix, which, however, will be read at the discretion of the PC.</div><div class="">* Position papers (6 pages max., including references) can report on research in progress or other issues of interest to the SAFA community. Examples of work suitable for position paper submissions include: novel ideas whose scope is not large enough for a full paper; important implementation techniques; novel interesting benchmark problems; short experimental studies; interesting applications that are not yet completely solved or analysed; position or challenge papers.</div><div class=""><br class=""></div><div class="">Submission are handled through the EasyChair conference management system (<a href="https://easychair.org/conferences/?conf=safa2022" class="">https://easychair.org/conferences/?conf=safa2022</a>).</div><div class=""><br class=""></div><div class="">All papers will be subject to blind peer review based on the standard criteria of relevance, significance of results, originality of ideas, soundness, and quality of the presentation.</div><div class=""><br class=""></div><div class="">All accepted papers will be published in the workshop proceedings via <a href="http://ceur-ws.org" class="">http://ceur-ws.org</a>, and will be presented at the workshop. At least one author of each accepted paper must register for the workshop (through the COMMA 2022 website, <a href="https://comma22.cs.cf.ac.uk" class="">https://comma22.cs.cf.ac.uk</a>) and present the contribution.</div><div class=""><br class=""></div><div class="">Organizers</div><div class="">===========================================================================================</div><div class="">* Sarah A. Gaggl (TU Dresden, Germany)</div><div class="">* Jean-Guy Mailly (LIPADE, University of Paris, France)</div><div class="">* Matthias Thimm (University of Hagen, Germany)</div><div class="">* Johannes P. Wallner (TU Graz, Austria)</div><div class=""><br class=""></div><div class="">Program Committee</div><div class="">===========================================================================================</div><div class="">Mario Alviano (University of Calabria, Italy)</div><div class="">Stefano Bistarelli (Università di Perugia, Italy)</div><div class="">Federico Cerutti (University of Brescia, Italy)</div><div class="">Andrea Cohen (Institute for Computer Science and Engineering,</div><div class="">Universidad Nacional del Sur, Argentina)</div><div class="">Sylvie Doutre (University of Toulouse 1 - IRIT, France)</div><div class="">Stefan Ellmauthaler (TU Dresden, Germany)</div><div class="">Massimiliano Giacomin (University of Brescia, Italy)</div><div class="">Matti Järvisalo (University of Helsinki, Finland)</div><div class="">Samer Nofal (German Jordanian University, Jordan)</div><div class="">Nir Oren (University of Aberdeen, United Kingdom)</div><div class="">Odinaldo Rodrigues (King's College London, United Kingdom)</div><div class="">Fabio Rossi (Università di Perugia, Italy)</div><div class="">Francesco Santini (Università di Perugia, Italy)</div><div class="">Mauro Vallati (University of Huddersfield, United Kingdom)</div><div class="">Serena Villata (WIMMICS Research Team, INRIA Sophia Antipolis, France)</div><div class="">Stefan Woltran (TU Wien, Austria)</div><div class="">===========================================================================================</div><div class=""><br class=""></div><div class=""><br class=""></div><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>