Splitting argumentation frameworks: An empirical evaluation

Ringo Baumann; Gerhard Brewka; Renata Wong

doi:10.1007/978-3-642-29184-5_2

Splitting argumentation frameworks: An empirical evaluation

Ringo Baumann^*, Gerhard Brewka, Renata Wong

^*Corresponding author for this work

Leipzig University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

25 Scopus citations

Abstract

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 ₁ and A ₂ such that extensions of A can be computed by (1) computing an extension E ₁ of A ₁, (2) modifying A ₂ based on E ₁, and (3) combining E ₁ and an extension E ₂ of the modified variant of A ₂. 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.

Original language	English
Title of host publication	Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers
Pages	17-31
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-29184-5_2
State	Published - 2012
Externally published	Yes
Event	1st International Workshop on Theory and Applications of Formal Argumentation, TAFA 2011 - Barcelona, Spain Duration: 16 07 2011 → 17 07 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7132 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st International Workshop on Theory and Applications of Formal Argumentation, TAFA 2011
Country/Territory	Spain
City	Barcelona
Period	16/07/11 → 17/07/11

Access to Document

10.1007/978-3-642-29184-5_2

Cite this

Baumann, R., Brewka, G., & Wong, R. (2012). Splitting argumentation frameworks: An empirical evaluation. In Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers (pp. 17-31). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7132 LNAI). https://doi.org/10.1007/978-3-642-29184-5_2

Baumann, Ringo ; Brewka, Gerhard ; Wong, Renata. / Splitting argumentation frameworks : An empirical evaluation. Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers. 2012. pp. 17-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{015b64dc70864322998da2ffe4e83e19,

title = "Splitting argumentation frameworks: An empirical evaluation",

abstract = "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.",

author = "Ringo Baumann and Gerhard Brewka and Renata Wong",

year = "2012",

doi = "10.1007/978-3-642-29184-5_2",

language = "英语",

isbn = "9783642291838",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "17--31",

booktitle = "Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers",

note = "1st International Workshop on Theory and Applications of Formal Argumentation, TAFA 2011 ; Conference date: 16-07-2011 Through 17-07-2011",

}

Baumann, R, Brewka, G & Wong, R 2012, Splitting argumentation frameworks: An empirical evaluation. in Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7132 LNAI, pp. 17-31, 1st International Workshop on Theory and Applications of Formal Argumentation, TAFA 2011, Barcelona, Spain, 16/07/11. https://doi.org/10.1007/978-3-642-29184-5_2

Splitting argumentation frameworks: An empirical evaluation. / Baumann, Ringo; Brewka, Gerhard; Wong, Renata.
Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers. 2012. p. 17-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7132 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Splitting argumentation frameworks

T2 - 1st International Workshop on Theory and Applications of Formal Argumentation, TAFA 2011

AU - Baumann, Ringo

AU - Brewka, Gerhard

AU - Wong, Renata

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84859592942&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-29184-5_2

DO - 10.1007/978-3-642-29184-5_2

M3 - 会议稿件

AN - SCOPUS:84859592942

SN - 9783642291838

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 17

EP - 31

BT - Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers

Y2 - 16 July 2011 through 17 July 2011

ER -

Baumann R, Brewka G, Wong R. Splitting argumentation frameworks: An empirical evaluation. In Theory and Applications of Formal Argumentation - First International Workshop, TAFA 2011, Revised Selected Papers. 2012. p. 17-31. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-29184-5_2

Splitting argumentation frameworks: An empirical evaluation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this