Most existing computational tools for assumption-based argumentation (ABA) focus on so-
called flat frameworks, disregarding the more general case. In this paper, we study an …

Assumption-based Argumentation (ABA) is a well-known structured argumentation
formalism, whereby arguments and attacks between them are drawn from rules, defeasible …

The expressiveness of any given formalism lays the theoretical foundation for more
specialized topics such as investigating dynamic reasoning environments. The modeling …

The structured argumentation system that represents arguments by premise-conclusion
pairs is called premise-conclusion argumentation (PA) and the one that represents …

ICCMA 2023 constitutes the 5th instantiation of International Competitions on Computational
Models of Argumentation, the main series of international competitions for evaluating the …

We develop a fixed-parameter tractable (FPT) algorithm for skeptical preferred reasoning in
assumption-based argumentation (ABA). To this end we make use of so-called backdoors …

While the flat fragment of assumption-based argumentation (ABA) is widely studied in the
literature, the general, non-flat case has mostly been neglected so far. Until recently, there …

Is an argument acceptable if all potential counter-arguments are unacceptable themselves?
In standard models of argumentation, the answer to this question is counter-intuitively not …

The field of formal argumentation is driven by situations where conflicting information need
to be balanced out argumentatively. However, if the given knowledge base does not induce …

In the area of symbolic AI, researchers strive to develop techniques to teach machines
(commonsense) reasoning. Human reasoning is often argumentative in its nature, and …