On Computing the Set of Acceptable Arguments in Abstract Argumentation

Matthias Thimm; Federico Cerutti; Mauro Vallati

doi:10.3233/FAIA200520

On Computing the Set of Acceptable Arguments in Abstract Argumentation

Matthias Thimm, Federico Cerutti, Mauro Vallati

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

Abstract

We investigate the computational problem of determining the set of acceptable arguments in abstract argumentation wrt. credulous and skeptical reasoning under grounded, complete, stable, and preferred semantics. In particular, we investigate the computational complexity of that problem and its verification variant, and develop four SAT-based algorithms for the case of credulous reasoning under complete semantics, two baseline approaches based on iterative acceptability queries and extension enumeration and two optimised algorithms.

Original language	English
Title of host publication	Proceedings of the 8th International Conference on Models of Argument
Subtitle of host publication	(COMMA 2020)
Editors	Henry Prakken, Stefano Bistarelli, Francesco Santini, Carlo Taticchi
Publisher	IOS Press
Pages	363-370
Number of pages	8
ISBN (Electronic)	9781643681078
ISBN (Print)	9781643681061
DOIs	https://doi.org/10.3233/FAIA200520
Publication status	Published - 31 Aug 2020
Event	8th International Conference on Computational Models of Argument - Online due to COVID-19 Duration: 8 Sep 2020 → 11 Sep 2020 Conference number: 8 https://comma2020.dmi.unipg.it/

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Publisher	IOS Press
Volume	326
ISSN (Print)	0922-6389
ISSN (Electronic)	1879-8314

Conference

Conference	8th International Conference on Computational Models of Argument
Abbreviated title	COMMA 2020
Period	8/09/20 → 11/09/20
Internet address	https://comma2020.dmi.unipg.it/

Access to Document

10.3233/FAIA200520Licence: CC BY-NC

Cite this

Thimm, M., Cerutti, F., & Vallati, M. (2020). On Computing the Set of Acceptable Arguments in Abstract Argumentation. In H. Prakken, S. Bistarelli, F. Santini, & C. Taticchi (Eds.), Proceedings of the 8th International Conference on Models of Argument : (COMMA 2020) (pp. 363-370). (Frontiers in Artificial Intelligence and Applications; Vol. 326). IOS Press. https://doi.org/10.3233/FAIA200520

Thimm, Matthias ; Cerutti, Federico ; Vallati, Mauro. / On Computing the Set of Acceptable Arguments in Abstract Argumentation. Proceedings of the 8th International Conference on Models of Argument : (COMMA 2020). editor / Henry Prakken ; Stefano Bistarelli ; Francesco Santini ; Carlo Taticchi. IOS Press, 2020. pp. 363-370 (Frontiers in Artificial Intelligence and Applications).

@inproceedings{c8ff40444aef4e8b964717a378c0afe6,

title = "On Computing the Set of Acceptable Arguments in Abstract Argumentation",

abstract = "We investigate the computational problem of determining the set of acceptable arguments in abstract argumentation wrt. credulous and skeptical reasoning under grounded, complete, stable, and preferred semantics. In particular, we investigate the computational complexity of that problem and its verification variant, and develop four SAT-based algorithms for the case of credulous reasoning under complete semantics, two baseline approaches based on iterative acceptability queries and extension enumeration and two optimised algorithms.",

keywords = "Abstract argumentation, Computational complexity, Algorithms",

author = "Matthias Thimm and Federico Cerutti and Mauro Vallati",

year = "2020",

month = aug,

day = "31",

doi = "10.3233/FAIA200520",

language = "English",

isbn = "9781643681061",

series = "Frontiers in Artificial Intelligence and Applications",

publisher = "IOS Press",

pages = "363--370",

editor = "Henry Prakken and Stefano Bistarelli and Francesco Santini and Carlo Taticchi",

booktitle = "Proceedings of the 8th International Conference on Models of Argument",

address = "Netherlands",

note = "8th International Conference on Computational Models of Argument, COMMA 2020 ; Conference date: 08-09-2020 Through 11-09-2020",

url = "https://comma2020.dmi.unipg.it/",

}

Thimm, M, Cerutti, F & Vallati, M 2020, On Computing the Set of Acceptable Arguments in Abstract Argumentation. in H Prakken, S Bistarelli, F Santini & C Taticchi (eds), Proceedings of the 8th International Conference on Models of Argument : (COMMA 2020). Frontiers in Artificial Intelligence and Applications, vol. 326, IOS Press, pp. 363-370, 8th International Conference on Computational Models of Argument, 8/09/20. https://doi.org/10.3233/FAIA200520

On Computing the Set of Acceptable Arguments in Abstract Argumentation. / Thimm, Matthias; Cerutti, Federico; Vallati, Mauro.

Proceedings of the 8th International Conference on Models of Argument : (COMMA 2020). ed. / Henry Prakken; Stefano Bistarelli; Francesco Santini; Carlo Taticchi. IOS Press, 2020. p. 363-370 (Frontiers in Artificial Intelligence and Applications; Vol. 326).

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

TY - GEN

T1 - On Computing the Set of Acceptable Arguments in Abstract Argumentation

AU - Thimm, Matthias

AU - Cerutti, Federico

AU - Vallati, Mauro

N1 - Conference code: 8

PY - 2020/8/31

Y1 - 2020/8/31

N2 - We investigate the computational problem of determining the set of acceptable arguments in abstract argumentation wrt. credulous and skeptical reasoning under grounded, complete, stable, and preferred semantics. In particular, we investigate the computational complexity of that problem and its verification variant, and develop four SAT-based algorithms for the case of credulous reasoning under complete semantics, two baseline approaches based on iterative acceptability queries and extension enumeration and two optimised algorithms.

AB - We investigate the computational problem of determining the set of acceptable arguments in abstract argumentation wrt. credulous and skeptical reasoning under grounded, complete, stable, and preferred semantics. In particular, we investigate the computational complexity of that problem and its verification variant, and develop four SAT-based algorithms for the case of credulous reasoning under complete semantics, two baseline approaches based on iterative acceptability queries and extension enumeration and two optimised algorithms.

KW - Abstract argumentation

KW - Computational complexity

KW - Algorithms

UR - http://ebooks.iospress.nl/volume/frontiers-in-artificial-intelligence-and-applications

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

U2 - 10.3233/FAIA200520

DO - 10.3233/FAIA200520

M3 - Conference contribution

SN - 9781643681061

T3 - Frontiers in Artificial Intelligence and Applications

SP - 363

EP - 370

BT - Proceedings of the 8th International Conference on Models of Argument

A2 - Prakken, Henry

A2 - Bistarelli, Stefano

A2 - Santini, Francesco

A2 - Taticchi, Carlo

PB - IOS Press

T2 - 8th International Conference on Computational Models of Argument

Y2 - 8 September 2020 through 11 September 2020

ER -

On Computing the Set of Acceptable Arguments in Abstract Argumentation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this