On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach. Issue 5 (September 2020)

• Record Type: Journal Article
• Authors: Alfano, Gianvincenzo; Greco, Sergio; Parisi, Francesco; Trubitsyna, Irina
• Is Part Of: Theory and practice of logic programming. Volume 20:Issue 5(2020)
• Page Start: 703
• Page End: 718
• Publication Date: 2020-09
• Subjects: abstract argumentation, -- argumentation semantics, -- partial stable models; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068420000253
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: Recently there has been an increasing interest in frameworks extending Dung's abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Although the relationships between AF semantics and Partial Stable Models (PSMs) of logic programs has been deeply investigated, this is not the case for more general frameworks extending AF. In this paper we explore the relationships between AF-based frameworks and PSMs. We show that every AF-based framework Δ can be translated into a logic program P Δ so that the extensions prescribed by different semantics of Δ coincide with subsets of the PSMs of P Δ . We provide a logic programming approach that characterizes, in an elegant and uniform way, the semantics of several AF-based frameworks. This result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports.