2012 | OriginalPaper | Chapter
Splitting Argumentation Frameworks: An Empirical Evaluation
Authors : Ringo Baumann, Gerhard Brewka, Renata Wong
Published in: Theorie and Applications of Formal Argumentation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In a recent paper Baumann [1] has shown that splitting results, similar to those known for logic programs under answer set semantics and default logic, can also be obtained for Dung argumentation frameworks (AFs). Under certain conditions a given AF
A
can be split into subparts
A
1
and
A
2
such that extensions of
A
can be computed by (1) computing an extension
E
1
of
A
1
, (2) modifying
A
2
based on
E
1
, and (3) combining
E
1
and an extension
E
2
of the modified variant of
A
2
. In this paper we perform a systematic empirical evaluation of the effects of splitting on the computation of extensions. Our study shows that the performance of algorithms may drastically improve when splitting is applied.