An Efficient Algorithm for Admissible Argumentation Stages

Tobia Zanetti, Massimiliano Giacomin, Mauro Vallati, Federico Cerutti

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper we introduce AASExts, an algorithm for computing admissible argumentation stage extensions—a.k.a. semi–stable extensions. Admissible argumentation stage extensions play a decisive role in unifying two lines of research in formal argumentation: admissible-based extensions as suggested by Dung in his seminar paper; and the traditional approach based on dialectical evaluation of the defeat status of arguments. In this paper, we improve techniques developed for other semantics, notably preferred semantics, as well as leverage—for the first time—recent advances in All-SAT community. We prove our proposed algorithm is sound and complete, and we show empirically that our implementation significantly outperforms even sophisticated ASP-based and SAT-based reduction approaches on existing benchmarks.

Original languageEnglish
Article number42
Pages (from-to)45-59
Number of pages15
JournalCEUR Workshop Proceedings
Volume2777
Early online date25 Nov 2020
Publication statusPublished - 16 Dec 2020
Event2020 Workshop on Advances In Argumentation In Artificial Intelligence - Virtual, Online
Duration: 25 Nov 202026 Nov 2020

Fingerprint Dive into the research topics of 'An Efficient Algorithm for Admissible Argumentation Stages'. Together they form a unique fingerprint.

Cite this