Abstract dialectical frameworks revisited

We present various new concepts and results related to abstract dialectical frameworks (ADFs), a power-ful generalization of Dung’s argumentation frame-works (AFs). In particular, we show how the ex-isting definitions of stable and preferred semantics which are restricted to the subcase of so-called bi-polar ADFs can be improved and generalized to arbitrary frameworks. Furthermore, we introduce preference handling methods for ADFs, allowing for both reasoning with and about preferences. Fi-nally, we present an implementation based on an encoding in answer set programming.