King's College London

Research portal

Representing and comparing large sets of extensions of abstract argumentation frameworks

Research output: Contribution to conference typesPaperpeer-review

Standard

Representing and comparing large sets of extensions of abstract argumentation frameworks. / Rodrigues, Odinaldo.

2019. 1154-1161 Paper presented at 34th Annual ACM Symposium on Applied Computing, SAC 2019, Limassol, Cyprus.

Research output: Contribution to conference typesPaperpeer-review

Harvard

Rodrigues, O 2019, 'Representing and comparing large sets of extensions of abstract argumentation frameworks', Paper presented at 34th Annual ACM Symposium on Applied Computing, SAC 2019, Limassol, Cyprus, 8/04/2019 - 12/04/2019 pp. 1154-1161. https://doi.org/10.1145/3297280.3297394

APA

Rodrigues, O. (2019). Representing and comparing large sets of extensions of abstract argumentation frameworks. 1154-1161. Paper presented at 34th Annual ACM Symposium on Applied Computing, SAC 2019, Limassol, Cyprus. https://doi.org/10.1145/3297280.3297394

Vancouver

Rodrigues O. Representing and comparing large sets of extensions of abstract argumentation frameworks. 2019. Paper presented at 34th Annual ACM Symposium on Applied Computing, SAC 2019, Limassol, Cyprus. https://doi.org/10.1145/3297280.3297394

Author

Rodrigues, Odinaldo. / Representing and comparing large sets of extensions of abstract argumentation frameworks. Paper presented at 34th Annual ACM Symposium on Applied Computing, SAC 2019, Limassol, Cyprus.8 p.

Bibtex Download

@conference{f72822f9493e41b3b38ffcacee0dab00,
title = "Representing and comparing large sets of extensions of abstract argumentation frameworks",
abstract = "In argumentation theory, some reasoning problems involve the enumeration of all extensions of an abstract argumentation framework. Abstractly speaking, extensions are simply subsets of a given domain having some special properties. The result of the enumeration is usually presented as a single text file with elements and sets separated by designated delimiters. Neither the elements within each set (a single extension), nor the extensions themselves are presented in any pre-defined order. Events such as the International Competition of Computational Models of Argumentation require the comparison of a large number of enumerations and thus performing the comparisons very efficiently has become very desirable. This paper presents and compares three different alternative representations of extensions, one of which is novel for the argumentation domain, and provides an empirical evaluation of their effectiveness in the comparison of large enumerations. We found that the newly proposed representation can perform the comparisons in a much more memory and time efficient manner than existing solutions.",
keywords = "Abstract argumentation frameworks, Computation of semantics, Verification of extensions",
author = "Odinaldo Rodrigues",
year = "2019",
month = apr,
day = "8",
doi = "10.1145/3297280.3297394",
language = "English",
pages = "1154--1161",
note = "34th Annual ACM Symposium on Applied Computing, SAC 2019 ; Conference date: 08-04-2019 Through 12-04-2019",

}

RIS (suitable for import to EndNote) Download

TY - CONF

T1 - Representing and comparing large sets of extensions of abstract argumentation frameworks

AU - Rodrigues, Odinaldo

PY - 2019/4/8

Y1 - 2019/4/8

N2 - In argumentation theory, some reasoning problems involve the enumeration of all extensions of an abstract argumentation framework. Abstractly speaking, extensions are simply subsets of a given domain having some special properties. The result of the enumeration is usually presented as a single text file with elements and sets separated by designated delimiters. Neither the elements within each set (a single extension), nor the extensions themselves are presented in any pre-defined order. Events such as the International Competition of Computational Models of Argumentation require the comparison of a large number of enumerations and thus performing the comparisons very efficiently has become very desirable. This paper presents and compares three different alternative representations of extensions, one of which is novel for the argumentation domain, and provides an empirical evaluation of their effectiveness in the comparison of large enumerations. We found that the newly proposed representation can perform the comparisons in a much more memory and time efficient manner than existing solutions.

AB - In argumentation theory, some reasoning problems involve the enumeration of all extensions of an abstract argumentation framework. Abstractly speaking, extensions are simply subsets of a given domain having some special properties. The result of the enumeration is usually presented as a single text file with elements and sets separated by designated delimiters. Neither the elements within each set (a single extension), nor the extensions themselves are presented in any pre-defined order. Events such as the International Competition of Computational Models of Argumentation require the comparison of a large number of enumerations and thus performing the comparisons very efficiently has become very desirable. This paper presents and compares three different alternative representations of extensions, one of which is novel for the argumentation domain, and provides an empirical evaluation of their effectiveness in the comparison of large enumerations. We found that the newly proposed representation can perform the comparisons in a much more memory and time efficient manner than existing solutions.

KW - Abstract argumentation frameworks

KW - Computation of semantics

KW - Verification of extensions

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

U2 - 10.1145/3297280.3297394

DO - 10.1145/3297280.3297394

M3 - Paper

SP - 1154

EP - 1161

T2 - 34th Annual ACM Symposium on Applied Computing, SAC 2019

Y2 - 8 April 2019 through 12 April 2019

ER -

View graph of relations

© 2020 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454