Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework

Tuomo Lehtonen, Johannes Peter Wallner, Matti Järvisalo

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Abstract

Rephrasing argumentation semantics in terms of subsets of defeasible elements allows for gaining new insights for reasoning about acceptance in established fragments of the central structured argumentation formalism of ASPIC+. We provide a non-trivial generalization of these recent results, capturing preferences in ASPIC+. In particular, considering preferences under the weakest-link principle, we show that the stable semantics can be phrased in terms of subsets of defeasible elements. We employ the rephrasing for establishing both complexity results and practical algorithms for reasoning about acceptance in this variant of ASPIC+. Justified by completeness for the second level of the polynomial hierarchy, we develop an iterative answer set solving based approach to reasoning about acceptance under the so-called elitist lifting in ASPIC+ frameworks. Our implementation of the approach scales well in practice.
Original languageEnglish
Title of host publicationProceedings KR
Pages215-225
Number of pages11
DOIs
Publication statusPublished - 2022
Event19th International Conference on Principles of Knowledge Representation and Reasoning: KR 2022 - Haifa, Haifa, Israel
Duration: 31 Jul 20225 Aug 2022

Conference

Conference19th International Conference on Principles of Knowledge Representation and Reasoning
Abbreviated titleKR 2022
Country/TerritoryIsrael
CityHaifa
Period31/07/225/08/22

Fingerprint

Dive into the research topics of 'Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework'. Together they form a unique fingerprint.

Cite this