Abstract argumentation frameworks (AFs), originally proposed by Dung, constitute a central
formal model for the study of computational aspects of argumentation in AI. Credulous and …

Abstract argumentation, as originally defined by Dung, is a model that allows the description
of certain information about arguments and relationships between them: in an abstract …

Control argumentation frameworks (CAFs) allow for modeling uncertainties inherent in
various argumentative settings. We establish a complete computational complexity map of …

Operations like belief change or merging have been adapted to the context of abstract
argumentation. However, these operations may require to express some uncertainty or …

Abstract argumentation frameworks (AFs) are a prevailing model for the formal
representation of argumentations in AI research. The generalized model of incomplete AFs …

The original possible winner problem consists of an unweighted election with partial
preferences and a distinguished candidate c and asks whether the preferences can be …

The principle-based approach is a methodology to classify and analyse argumentation
semantics. In this paper we classify seven of the main alternatives for argumentation …

The notion of stability in a structured argumentation setup characterizes situations where the
acceptance status associated with a given literal will not be impacted by any future evolution …

Abstract Baumeister et al.[8] introduced the possible winner with uncertain weights problem
which, given a weighted election with the weights of some voters as yet unspecified, asks …

We consider the recently introduced vacuous reduct semantics in abstract argumentation
that allows the composition of arbitrary argumentation semantics through the notion of the …