Extensions of Dung’s abstract Argumentation Framework (AF) include the general class of Recursive Bipolar AFs (Rec-BAFs), i.e., AFs with recursive attacks and 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 Rec-BAFs. In this paper we explore this relationship, showing that a Rec-BAF ∆ can be translated into a logic program P∆ so that the extensions of ∆ under different argumentation semantics 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 which belong to the class of Rec-BAFs. This result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports.
On the semantics of recursive bipolar AFs and partial stable models
Alfano G.
;Greco S.;Parisi F.;Trubitsyna I.
2020-01-01
Abstract
Extensions of Dung’s abstract Argumentation Framework (AF) include the general class of Recursive Bipolar AFs (Rec-BAFs), i.e., AFs with recursive attacks and 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 Rec-BAFs. In this paper we explore this relationship, showing that a Rec-BAF ∆ can be translated into a logic program P∆ so that the extensions of ∆ under different argumentation semantics 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 which belong to the class of Rec-BAFs. This result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
