Equivalence in Logic-Based Argumentation

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

Once the argumentation graph is generated (in this graph the nodes represent the arguments and the attacks the binary attack relation) the reasoning step will compute the

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

It is obvious that in the case of a consistent knowledge base, the corresponding argumentation framework has exactly one extension, which contains all arguments, in- dependently of

Once the argumentation graph is generated (in this graph the nodes represent the arguments and the attacks the binary attack relation) the reasoning step will compute the

We have noticed that during collaborative medical processes modelled with the Dung argumentation system [ 2 , 4 ] inconsis- tencies can appear (for example bad attack relation due

Abstract argumentation frameworks return two outputs: a set of extensions of arguments under a given semantics, and a status for each argument. This latter is computed on the basis

The abstract bipolar argumentation framework presented in [13] extends Dung’s framework in order to take into account both negative interactions expressed by the attack relation