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

Tuomo Lehtonen, Johannes Peter Wallner, Matti Järvisalo

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandBegutachtung

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.
Originalspracheenglisch
TitelProceedings KR
Seiten215-225
Seitenumfang11
DOIs
PublikationsstatusVeröffentlicht - 2022
Veranstaltung19th International Conference on Principles of Knowledge Representation and Reasoning: KR 2022 - Haifa, Haifa, Israel
Dauer: 31 Juli 20225 Aug. 2022

Konferenz

Konferenz19th International Conference on Principles of Knowledge Representation and Reasoning
KurztitelKR 2022
Land/GebietIsrael
OrtHaifa
Zeitraum31/07/225/08/22

Fingerprint

Untersuchen Sie die Forschungsthemen von „Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren