| Abstrakt: |
Much of the formal study of algorithmic concerns with respect to semantics for abstract argumentation frameworks has focused on the issue of computational complexity. In contrast matters regarding computability have been largely neglected. Recent trends in semantics have, however, started to concentrate not so much on the formulation of novel semantics but more on identifying common properties: for example, from basic ideas such as conflict-freeness through to quite sophisticated ideas such as serializability. The aim of this paper is to look at the implications these more recent studies have for computability rather than computational complexity. [ABSTRACT FROM AUTHOR] |
