=Paper=
{{Paper
|id=Vol-3236/xpreface
|storemode=property
|title=None
|pdfUrl=https://ceur-ws.org/Vol-3236/xpreface.pdf
|volume=Vol-3236
}}
==None==
<pdf width="1500px">https://ceur-ws.org/Vol-3236/xpreface.pdf</pdf>
<pre>
 Fourth International Workshop on Systems and
   Algorithms for Formal Argumentation 2022
                  Proceedings


Preface
Computational argumentation is a field within Artificial Intelligence studying
representation, interaction, and computation of arguments. Application do-
mains of approaches to computational argumentation include medicine, account-
ing, chemistry, and law, as well as other areas that benefiting from automated
decision making. With strong roots in non-monotonic reasoning and logic pro-
gramming, many models of argumentation inherit high computational complex-
ity of argumentative reasoning.
    Algorithms and systems dealing with argumentative reasoning are a core part
of computational argumentation, also witnessed by the popular International
Competition on Computational Models of Argumentation (ICCMA). This work-
shop complements the competition and provides a forum to discuss and present
novel approaches and ideas related to algorithmic approaches to all aspects of ar-
gumentation. Co-located with the International Conference on Computational
Models of Argument (COMMA), a first workshop had been organised in Pots-
dam (Germany) in 2016, a second one in Warsaw (Poland) in 2018, and a third
one virtually in 2020.
    In this fourth edition, we received nine submissions which were all accepted
as regular papers for this volume after a peer-review. Additionally, this volume
contains an abstract of the invited talk on “Model Counting, its Relationship to
Symbolic Quantitative AI, and a Glimpse into Practical Solving” by Johannes
K. Fichte.
    We thank the Center for Perspicuous Computing (CPEC) and the COMMA
2022 conference organization for their generous support.

September 2022                                                  Sarah A. Gaggl
                                                               Jean-Guy Mailly
                                                               Matthias Thimm
                                                            Johannes P. Wallner
                                                                       (editors)
Programme Committee
Mario Alviano (University of Calabria, Italy)
Stefano Bistarelli (University of Perugia, Italy)
Federico Cerutti (University of Brescia, Italy)
Andrea Cohen (Institute for Computer Science and Engineering (ICIC),
CONICET-UNS, Argentina)
Sylvie Doutre (University of Toulouse 1 - IRIT, France)
Stefan Ellmauthaler (TU Dresden, Germany)
Massimiliano Giacomin (University of Brescia, Italy)
Matti Järvisalo (University of Helsinki, Finland)
Samer Nofal (German Jordanian University, Jordan)
Nir Oren (University of Aberdeen, United Kingdom)
Odinaldo Rodrigues (King’s College London, United Kingdom)
Fabio Rossi (University of Perugia, Italy)
Francesco Santini (University of Perugia, Italy)
Mauro Vallati (University of Huddersfield, United Kingdom)
Serena Villata (CNRS - Laboratoire d’Informatique, Signaux et Systèmes de
Sophia-Antipolis, France)
Stefan Woltran (TU Vienna, Austria)

Subreviewers
Carlo Taticchi
Matthias König
Tuomo Lehtonen


Contents
   • Invited Talk: Model Counting, its Relationship to Symbolic
     Quantitative AI, and a Glimpse into Practical Solving
         Johannes Klaus Fichte
   • Odd or Even: Handling N-lemmas in a Dynamic Argumentation
     Framework
        Kazuko Takahashi

   • A Sound and Complete Dialogue System for Handling Misun-
     derstandings
        Andreas Xydis, Christopher Hampson, Sanjay Modgil, Elizabeth Black
   • Strong Admissibility, a Tractable Algorithmic Approach
        Martin Caminada, Sri Harikrishnan
   • Computing the Labellings of Higher-Order Abstract Argumen-
     tation Frameworks
         Sylvie Doutre, Marie-Christine Lagasquie-Schiex
• Strategies in Flexible Dispute Derivations for Assumption-Based
  Argumentation
     Martin Diller, Sarah Alice Gaggl, Piotr Gorczyca
• Realisability of Rankings-based Semantics
      Kenneth Skiba, Matthias Thimm, Tjitze Rienstra, Jesse Heyninck,
  Gabriele Kern-Isberner
• Improving Reasoning Efficiency in ASPIC+ with Backwards
  Chaining and Partial Arguments
     Hao Wu, Bruno Yun, Nir Oren

• Deletion-Backdoors for Argumentation Frameworks with Collec-
  tive Attacks
      Wolfgang Dvořák, Matthias König, Stefan Woltran
• A Labeling Based Backtracking Solver for Abstract Argumenta-
  tion
      Lukas Kinder, Matthias Thimm, Bart Verheij

</pre>