On the Aggregation of Argumentation Frameworks

Note that Λ L 2 is nonempty, as it includes the labelling that assigns undec to all arguments, and since AF is finite there is at least a maximal (w.r.t. Suppose by contradiction that

Summarizing, this logic of meta-argumentation allows us to specify and verify complex requirements for extended frameworks, such as extended argumentation frameworks with higher

In order to evaluate the solvers against a range of problems, ICCMA uses AAFs taken from a number of domains with particular structural properties. The results of the 2nd ICCMA

We first pro- posed a technique for incrementally computing extensions of dynamic abstract argu- mentation frameworks (AFs): given an initial extension and a set of updates, our

Then, it is possible to make a parallel between the classical model-based approach from the AGM framework (where the belief change operators are represented as a ranking

– Second, for the general case of knowledge bases with any number of facts, rules or negative constraints we unveil the following structural properties: the presence of a

We present some graph theoretical properties of argumentation graphs obtained from an inconsistent knowledge base expressed using existential rules.. ACM

[2012] propose some rationality properties for characterizing aggregation of sets of argumentation frame- works, based on translations of properties coming from social choice theory