Computational Argumentation – Formal Models
          and Complexity Results?

                         Stefan Woltran[0000−0003−1594−8972]

                Institute of Logic and Computation, TU Wien, Austria
                              woltran@dbai.tuwien.ac.at



        Abstract Argumentation is a communicative and interactional act aimed
        at resolving a difference of opinion. The last two decades have seen a for-
        mal and computational turn in argumentation theory with the goal to
        automate different aspects of argumentation. This leads to several chal-
        lenges from an AI perspective, including efficient algorithms that need to
        be designed to guarantee short response times of argumentation systems.
        In this talk, I first give a broad overview on the area of computational
        argumentation and discuss shortcomings of current approaches. We then
        identify a particular leak in the popular argumentation-pipeline model,
        where conflict resolution is solely based on abstract arguments rather
        than on the arguments’ claims. I will introduce a new formal model
        that shifts the focus from arguments to claims and give a comprehensive
        complexity analysis of several argumentation semantics under this claim-
        centric view. In addition, the talk addresses the complexity of sub-classes
        and presents novel parameterizations which exploit the nature of claims
        explicitly along with fixed-parameter tractability results.




?
    Copyright c 2020 for this paper by its authors. Use permitted under Creative Com-
    mons License Attribution 4.0 International (CC BY 4.0). This work has been sup-
    ported by the Austrian Science Fund (FWF), Grants Y698 and P32830, and the
    Wiener Wissenschafts-, Forschungs- und Technologiefonds (WWTF), Grant ICT19-
    065.