Comparing Logic Programming and Formal Argumentation; the case of Ideal and Eager Semantics.

The connection between logic programming and formal argumentation has been studied starting from the landmark
1995 paper of Dung. Subsequent work has identified a standard translation from logic programs to (instantiated) argumen-
tation frameworks, under which pairwise correspondences hold between various logic programming semantics and various
formal argumentation semantics. This includes the correspondence between 3-valued stable and complete semantics, between
well-founded and grounded semantics and between 2-valued stable (LP) and stable (argumentation) semantics. In the current
paper, we show that the existing translation is able to yield the additional correspondence between ideal semantics for logic
programming and ideal semantics for formal argumentation. We also show that correspondence does not hold between eager
semantics for logic programming and eager semantics for formal argumentation, at least when translating from logic program-
ming to formal argumentation. Overall, the current work should be seen as completing the analysis of correspondences between
mainstream admissibility-based argumentation semantics and their logic programming counterparts