On Computing the Set of Acceptable Arguments in Abstract Argumentation

Matthias Thimm, Federico Cerutti, Mauro Vallati

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

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 stable semantics, two baseline approaches based on iterative acceptability queries and extension enumeration and two optimised algorithms.
Original languageEnglish
Title of host publicationProceedings of the 8th International Conference on Models of Argument
Subtitle of host publication(COMMA 2020)
PublisherIOS Press
Publication statusAccepted/In press - 19 Jun 2020
Event8th International Conference on Computational Models of Argument - Online due to COVID-19
Duration: 8 Sep 202011 Sep 2020
Conference number: 8
https://comma2020.dmi.unipg.it/

Conference

Conference8th International Conference on Computational Models of Argument
Abbreviated titleCOMMA 2020
Period8/09/2011/09/20
Internet address

Fingerprint Dive into the research topics of 'On Computing the Set of Acceptable Arguments in Abstract Argumentation'. Together they form a unique fingerprint.

  • Cite this

    Thimm, M., Cerutti, F., & Vallati, M. (Accepted/In press). On Computing the Set of Acceptable Arguments in Abstract Argumentation. In Proceedings of the 8th International Conference on Models of Argument : (COMMA 2020) IOS Press.