Semantics for Higher Level Attacks in Extended Argumentation Frames Part 1: Overview

In 2005 the author introduced networks which allow attacks on attacks of any level. So if a → b reads a attacks b, then this attack can itself be attacked by another node c. This attack itself can attack another node d. This situation can be iterated to any level with attacks and nodes attacking other attacks and other nodes. In this paper we provide semantics (of extensions) to such networks. We offer three different approaches to obtaining semantics.

1. The translation approach This uses the methodology of ‘Logic by translation’. We translate faithfully the new networks into ordinary Dung networks with more nodes and extract the semantics from the translation.
2. The labelling approach This method regards the arrows as additional entities to be attacked and to mount attacks and applies a variation of the usual machinery of Camindada like labelling to the network. The new concept we need to employ here is that of ‘joint attacks’.
3. The logic programming approach We translate the higher level network into a logic program and obtain semantics for it through known semantics for logic programs.

We then compare our methods with those of S. Modgil and P. M. Dung et al.