Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledgerepresentation capabilities those formalisms offer. We provide such an investigation in terms of different semantics proposed for abstract argumentation frameworks, a nonmonotonic yet simple formalism which received increasing interest within the last...

We prove that the range of a symmetric matrix over GF (2) always contains its diagonal. This is best possible in several ways, for example GF (2) cannot be replaced by any other field.

In this research note, we introduce a graded BDI agent development framework, g-BDI for short, that allows to build agents as multi-context systems that reason about three fundamental and graded mental attitudes (i.e. beliefs, desires and intentions). We propose a sound and complete logical framework for them and some logical extensions to accommodate slightly different views on desires.

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...