A Labelling Semantics and Strong Admissibility for Weighted Argumentation Frameworks. (19th January 2022)

• Record Type: Journal Article
• Authors: Bistarelli, Stefano; Taticchi, Carlo
• Is Part Of: Journal of logic and computation. Volume 32:Number 2(2022)
• Page Start: 281
• Page End: 306
• Publication Date: 2022-01-19
• Subjects: Weighted argumentation -- labelling semantics -- strong admissibility; Logic programming -- Periodicals; Logic, Symbolic and mathematical -- Periodicals; Computational complexity -- Periodicals; 005.115
• DOI: 10.1093/logcom/exab085
• Languages: English
• ISSNs: 0955-792X

Abstract

Abstract: Argumentation Theory provides tools for both modelling and reasoning with controversial information and is a methodology that is often used as a way to give explanations to results provided using machine learning techniques. In this context, labelling-based semantics for Abstract Argumentation Frameworks (AFs) allow for establishing the acceptability of sets of arguments, dividing them into three partitions: in, out and undecidable (instead of classical Dung acceptable and not acceptable sets). This kind of semantics have been studied only for classical AFs, while the more powerful weighted and preference-based frameworks have not been studied yet. In this paper, we define a novel labelling semantics for Weighted Argumentation Frameworks (WAFs), extending and generalizing the crisp one, and we provide some insights towards a definition of strong admissibility for WAFs.