As shown by [9], argumentation frameworks provide a unifying and powerful tool for the study of several formal systems developed for common-sense reasoning, as well as for giving a semantics to logic programs. Argumentation is based on the exchange and valuation of interacting arguments which support opinions and assertions. It can be applied, among others, in the legal domain, for collective decision support systems or for negotiation support.

The fundamental characteristic of an argumentation system is the interaction between arguments. In particular, a relation of attack may exist between arguments. For example, if the argument takes the form of a logical proof, arguments for a proposition and arguments against this proposition can be advanced. In that case, the attack relation relies on logical inconsistency.

The argumentation process is usually divided in two steps: a valuation of the relative strength of the arguments, followed by the selection of the most acceptable arguments.

In the valuation step, it is usual to distinguish two different types of valuations:

Intrinsic valuation and interaction-based valuation have often been used separately, according to the considered applications. Some recent works however consider a combination of both approaches (see [1,14,21]).

Considering now the selection of the more acceptable arguments, it is usual to distinguish two approaches:

It is clear that except for intrinsic valuations, most proposals do not allow for any gradual notion of valuation or acceptability (i.e. there is a low number of levels to describe values and the acceptability is usually binary). Our aim is therefore to introduce graduality in these two steps.

However, the processes of valuation and of selection are often linked together. This is the case when the selection is done on the basis of the value of arguments5 or when the selection defines a binary valuation on arguments. We will therefore:

Some graduality has already been introduced in argumentation systems. For instance, in [21], degrees of justification for beliefs are computed. Arguments are sequences of conclusive and/or prima-facie inferences. Arguments are collected in a graph where a node represents the conclusion of an argument, a support link ties a node to nodes from which it is inferred, and an attack link indicates an attack between nodes. The degree of justification of a belief is computed from the strength of the arguments concluding that belief and the strength of the arguments concluding on an attacker of the belief.

Our work takes place in a more abstract framework since we do not consider any argument structure. Our valuation models are based on interactions between arguments and directly apply to arguments.

We use the framework defined by [9]: a set of arguments and a binary attack relation between arguments. We also use a graphical representation of argumentation systems (see Section 2). The gradualisation of interaction-based valuations will be presented in Section 3. Then, in Section 4, we will consider different mechanisms leading to gradual acceptability, sometimes relying on the gradual valuations defined in Section 3. We will conclude in Section 5.

All the proofs of the properties stated in Sections 3 and 4 will be given in Appendix A.

Marie-Christine Lagasquie 2005-02-04