Open AccessComparing logic programming and formal argumentation; the case of ideal and eager semantics
Author(s) -
Martin Caminada,
Sri Harikrishnan,
Samy Sá
Publication year - 2022
Publication title -
argument and computation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 20
eISSN - 1946-2166
pISSN - 1946-2174
DOI - 10.3233/aac-200528
Subject(s) - well founded semantics , argumentation theory , programming language , logic programming , computer science , action semantics , denotational semantics , operational semantics , formal semantics (linguistics) , semantics (computer science) , stable model semantics , computational semantics , theoretical computer science , mathematics , epistemology , philosophy
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) argumentation 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 programming 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.