Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Admissibility in the abstract dialectical framework

Polberg, Sylwia ORCID:, Wallner, Johannes Peter and Woltran, Stefan 2013. Admissibility in the abstract dialectical framework. Lecture notes in computer science 8143 , pp. 102-118. 10.1007/978-3-642-40624-9_7

[thumbnail of admissibility_adf.pdf]
PDF - Accepted Post-Print Version
Download (294kB) | Preview


The aim of this paper is to study the concept of admissibility in abstract dialectical frameworks (ADFs). While admissibility is well-understood in Dung-style frameworks, a generalization to ADFs is not trivial. Indeed, the original proposal turned out to behave unintuitively at certain instances. A recent approach circumvented this problem by using a three-valued concept. In this paper, we propose a novel two-valued approach which more directly follows the original understanding of admissibility. We compare the two approaches and show that they behave differently on certain ADFs. Our results imply that for generalizations of Dung-style frameworks, establishing a precise correspondence between two-valued (i.e. extension-based) and three-value (i.e. labeling-based) characterizations of argumentation semantics is not easy and requires further investigations.

Item Type: Article
Date Type: Published Online
Status: Published
Schools: Computer Science & Informatics
Publisher: Springer
ISSN: 1611-3349
Funders: FWF Austrian Science Fund, Vienna PhD School of Informatics
Date of First Compliant Deposit: 12 March 2019
Last Modified: 06 Nov 2023 18:03

Citation Data

Cited 10 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics