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

A generalized notion of consistency with applications to formal argumentation

Baroni, Pietro, Cerutti, Federico ORCID: and Giacomin, Massimiliano 2022. A generalized notion of consistency with applications to formal argumentation. Toni, Polberg, Sylwia ORCID:, Booth, Richard ORCID:, Caminada, Martin ORCID: and Kido, Hiroyuki ORCID:, eds. Computational Models of Argument, Vol. 353. Frontiers in Artificial Intelligence and Applications, IOS Press, pp. 56-67. (10.3233/FAIA220141)

[thumbnail of FAIA-353-FAIA220141.pdf] PDF - Published Version
Available under License Creative Commons Attribution Non-commercial.

Download (264kB)


We propose a generic notion of consistency in an abstract labelling setting, based on two relations: one of intolerance between the labelled elements and one of incompatibility between the labels assigned to them, thus allowing a spectrum of consistency requirements depending on the actual choice of these relations. As a first application to formal argumentation, we show that traditional Dung’s semantics can be put in correspondence with different consistency requirements in this context. We consider then the issue of consistency preservation when a labelling is obtained as a synthesis of a set of labellings, as is the case for the traditional notion of argument justification. In this context we provide a general characterization of consistency-preserving synthesis functions and analyze the case of argument justification in this respect.

Item Type: Book Section
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Publisher: IOS Press
ISBN: 978-1-64368-307-2
ISSN: 0922-6389
Date of First Compliant Deposit: 14 December 2022
Last Modified: 19 May 2023 13:39

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics