Paracoherent Answer Set Semantics meets Argumentation Frameworks. Issue 5 (September 2019)

• Record Type: Journal Article
• Authors: AMENDOLA, GIOVANNI; RICCA, FRANCESCO
• Is Part Of: Theory and practice of logic programming. Volume 19:Issue 5/6(2019)
• Page Start: 688
• Page End: 704
• Publication Date: 2019-09
• Subjects: Answer Set Programming, -- Abstract Argumentation, -- Paracoherent reasoning; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068419000139
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotonic logics for AI. Relations between argumentation framework (AF) semantics and logic programming ones are investigating more and more. In particular, great attention has been given to the well-known stable extensions of an AF, that are closely related to the answer sets of a logic program. However, if a framework admits a small incoherent part, no stable extension can be provided. To overcome this shortcoming, two semantics generalizing stable extensions have been studied, namely semi-stable and stage. In this paper, we show that another perspective is possible on incoherent AFs, called paracoherent extensions, as they have a counterpart in paracoherent answer set semantics. We compare this perspective with semi-stable and stage semantics, by showing that computational costs remain unchanged, and moreover an interesting symmetric behaviour is maintained.