Gradual semantics within abstract argumentation associate an acceptability score with every argument in a system, and from which a preference ordering over arguments can be derived. While some semantics operate over standard argumentation frameworks, many utilise a weighted framework, where a numeric initial weight is associated with each argument. Recent work has examined inverse problems for gradual semantics. For example: (i) Given an argumentation framework, a gradual semantics, and a preference ordering as inputs, what weights are needed over arguments in the framework to obtain the desired preference ordering? Or (ii) given a set of weighted arguments, a gradual semantics, and some desirable acceptability scores over arguments, what must the attack relation be?

In this seminar, we explore those inverse problems and provide algorithms as well as analytical approaches for them.