Abstract
AbstractIn 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference65 articles.
1. Complete extensions in argumentation coincide with 3-valued stable models in logic programming;Wu;Studia Logica 93,2009
2. Lin, F. and Zhao, X. 2004. On odd and even cycles in normal logic programs. In AAAI. AAAI Press / The MIT Press, 80–85.
3. An encompassing framework for Paraconsistent Logic Programs
4. Normal forms for answer sets programming;Costantini;TPLP 5,2005
5. Logical weak completions of paraconsistent logics;Galindo;J. Log. Comput. 18,2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献