[7] gives a comparison of these approaches with some existing approaches ([9,13,4]), and also a comparison of the ``local'' approaches and the ``global'' approach. The improvement of the global approach proposed in this paper does not modify the main results of this comparison.
Let us recall here an example of the essential point which differentiates them (this example has already been presented at the beginning of Section 3):
In the local approach, is better than
(since
suffers one
attack whereas
suffers two attacks).
In the global approach, is better than
(since it has at least
a defence whereas
has none). In this case,
loses its
negative status of attacker, since it is in fact ``carrying a
defence'' for
.
The following table synthesises the results about the different proposed valuations:
global approach | ||||||||||
|
![]() |
|
![]() |
|
![]() |
|
||||
local approach | |||||||||||||||||||||
|
![]() |
|
|||||||||||||||||||
The difference between the local approaches and the global approach is also illustrated by the following property:
This property illustrates the ``independence'' of branches during the
computation of the values in the global approach, even when these
branches are not graphically independent. On the following example,
and
have the same value
though they are the root
of different subgraphs:
This property is not satisfied by the local approach since, using the
underlying principles of the local approach (see
Property 4), the value of the argument
must be at least as good as (and sometimes better than23) the value of the argument
(
having one direct attacker, and
having two direct
attackers).
Marie-Christine Lagasquie 2005-02-04