Algorithm selection for preferred extensions enumeration

Massimiliano Giacomin, Federico Cerutti, Mauro Vallati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For preferred semantics four algorithms have been recently proposed, AspartixM, NAD-Alg, PrefSAT and SCC-P, with significant runtime variations. This work is a first comprehensive exploration of the graph features and of their impact on the execution time of state-of-the-art preferred extensions enumeration algorithms. Following other areas of AI, we exploit empirical performance models, predictive models that relate instance features and algorithms performance. The result is an approach able to select the “best” algorithm for any Dung's argumentation framework with an accuracy, on the average, of the 80%. Moreover, we show that an algorithm selection approach based on classification can select the fastest algorithm in about the double of the number of cases where the most efficient algorithm outperforms the other ones (SCC-P), and about three times the number of cases of the second most efficient algorithm (PrefSAT).
Original languageEnglish
Title of host publicationComputational Models of Argument
Subtitle of host publicationProceedings of COMMA 2014
PublisherIOS Press
Pages221-232
Number of pages12
Volume266
ISBN (Electronic) 9781614994367
ISBN (Print) 9781614994350
DOIs
Publication statusPublished - 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press
Volume266

Fingerprint

Semantics

Cite this

Giacomin, M., Cerutti, F., & Vallati, M. (2014). Algorithm selection for preferred extensions enumeration. In Computational Models of Argument: Proceedings of COMMA 2014 (Vol. 266, pp. 221-232). (Frontiers in Artificial Intelligence and Applications; Vol. 266). IOS Press. https://doi.org/10.3233/978-1-61499-436-7-221
Giacomin, Massimiliano ; Cerutti, Federico ; Vallati, Mauro. / Algorithm selection for preferred extensions enumeration. Computational Models of Argument: Proceedings of COMMA 2014. Vol. 266 IOS Press, 2014. pp. 221-232 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{80b8616f5446472395d6c0fc382193ac,
title = "Algorithm selection for preferred extensions enumeration",
abstract = "Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For preferred semantics four algorithms have been recently proposed, AspartixM, NAD-Alg, PrefSAT and SCC-P, with significant runtime variations. This work is a first comprehensive exploration of the graph features and of their impact on the execution time of state-of-the-art preferred extensions enumeration algorithms. Following other areas of AI, we exploit empirical performance models, predictive models that relate instance features and algorithms performance. The result is an approach able to select the “best” algorithm for any Dung's argumentation framework with an accuracy, on the average, of the 80{\%}. Moreover, we show that an algorithm selection approach based on classification can select the fastest algorithm in about the double of the number of cases where the most efficient algorithm outperforms the other ones (SCC-P), and about three times the number of cases of the second most efficient algorithm (PrefSAT).",
keywords = "abstract argumentation, semantics extensions",
author = "Massimiliano Giacomin and Federico Cerutti and Mauro Vallati",
year = "2014",
doi = "10.3233/978-1-61499-436-7-221",
language = "English",
isbn = "9781614994350",
volume = "266",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "221--232",
booktitle = "Computational Models of Argument",
address = "Netherlands",

}

Giacomin, M, Cerutti, F & Vallati, M 2014, Algorithm selection for preferred extensions enumeration. in Computational Models of Argument: Proceedings of COMMA 2014. vol. 266, Frontiers in Artificial Intelligence and Applications, vol. 266, IOS Press, pp. 221-232. https://doi.org/10.3233/978-1-61499-436-7-221

Algorithm selection for preferred extensions enumeration. / Giacomin, Massimiliano; Cerutti, Federico; Vallati, Mauro.

Computational Models of Argument: Proceedings of COMMA 2014. Vol. 266 IOS Press, 2014. p. 221-232 (Frontiers in Artificial Intelligence and Applications; Vol. 266).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Algorithm selection for preferred extensions enumeration

AU - Giacomin, Massimiliano

AU - Cerutti, Federico

AU - Vallati, Mauro

PY - 2014

Y1 - 2014

N2 - Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For preferred semantics four algorithms have been recently proposed, AspartixM, NAD-Alg, PrefSAT and SCC-P, with significant runtime variations. This work is a first comprehensive exploration of the graph features and of their impact on the execution time of state-of-the-art preferred extensions enumeration algorithms. Following other areas of AI, we exploit empirical performance models, predictive models that relate instance features and algorithms performance. The result is an approach able to select the “best” algorithm for any Dung's argumentation framework with an accuracy, on the average, of the 80%. Moreover, we show that an algorithm selection approach based on classification can select the fastest algorithm in about the double of the number of cases where the most efficient algorithm outperforms the other ones (SCC-P), and about three times the number of cases of the second most efficient algorithm (PrefSAT).

AB - Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For preferred semantics four algorithms have been recently proposed, AspartixM, NAD-Alg, PrefSAT and SCC-P, with significant runtime variations. This work is a first comprehensive exploration of the graph features and of their impact on the execution time of state-of-the-art preferred extensions enumeration algorithms. Following other areas of AI, we exploit empirical performance models, predictive models that relate instance features and algorithms performance. The result is an approach able to select the “best” algorithm for any Dung's argumentation framework with an accuracy, on the average, of the 80%. Moreover, we show that an algorithm selection approach based on classification can select the fastest algorithm in about the double of the number of cases where the most efficient algorithm outperforms the other ones (SCC-P), and about three times the number of cases of the second most efficient algorithm (PrefSAT).

KW - abstract argumentation

KW - semantics extensions

U2 - 10.3233/978-1-61499-436-7-221

DO - 10.3233/978-1-61499-436-7-221

M3 - Conference contribution

SN - 9781614994350

VL - 266

T3 - Frontiers in Artificial Intelligence and Applications

SP - 221

EP - 232

BT - Computational Models of Argument

PB - IOS Press

ER -

Giacomin M, Cerutti F, Vallati M. Algorithm selection for preferred extensions enumeration. In Computational Models of Argument: Proceedings of COMMA 2014. Vol. 266. IOS Press. 2014. p. 221-232. (Frontiers in Artificial Intelligence and Applications). https://doi.org/10.3233/978-1-61499-436-7-221