We continue recent work on the problem of aggregating labellings of an argumentation framework by adapting the distance-based framework of Miller and Osherson from binary judgment aggregation to the argumentation setting. To instantiate the framework we employ some notions of labellingdistance recently introduced by Booth et al., in the process generalising and extending some of the latters’ re...

In this paper we investigate the impact of automated configuration techniques on the ArgSemSAT solver—runner-up of the ICCMA 2015—for solving the enumeration of preferred extensions. Moreover, we introduce a fully automated method for varying how argumentation frameworks are represented in the input file, and evaluate how the joint configuration of frameworks and ArgSemSAT parameters can have a...

Carneades is a recently proposed formalism for structured argumentation with varying proof standards. An open question is its relation with Dung’s seminal abstract approach to argumentation. In this paper the two formalisms are formally related by translating Carneades into ASPIC, another recently proposed formalism for structured argumentation. Since ASPIC is defined to generate Dungstyle abst...

We determine lower bounds for the number of random vectors in GF (q), chosen uniformly from vectors having k non-zero co-ordinates, needed to obtain a dependent set over GF (q).

Model-based propositional belief merging operators are constructed from distances between the interpretations, or states, of the logic under consideration. In this paper we extend the notion of a distance between interpretations to generalised versions of propositional interpretations referred to as m-states. m-states allow for the definition of m-merging operators, which are generalisations of...

Let F be a totally real field, and v a place of F dividing an odd prime p. We study the weight part of Serre’s conjecture for continuous totally odd representations ρ : GF → GL2(Fp) that are reducible locally at v. Let W be the set of predicted Serre weights for the semisimplification of ρ|GFv . We prove that when ρ|GFv is generic, the Serre weights inW for which ρ is modular are exactly the on...

This paper describes an approach to user configuration of activity awareness. This approach offers users increased flexibility by allowing the use of multiple methods of configuration to be used within a unified framework; these configuration methods can include context, policy rules and automatic techniques of configuring behaviour. In this paper we describe the benefits of this flexibility an...

However, the implication from (1) to (2) is equivalent to the principle of dependent choices (as the reader can show for himself) and cannot be proved in ZF. A relation < on X is called well-founded if any of these statements holds. Intuitionistically, the three statements are far from equivalent (hence, in formalizing an intuitionistic notion of well-foundedness, care is needed). Notion (1) is...