Paracoherent Answer Set Semantics meets Argumentation Frameworks
원문 초록
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. Under consideration for acceptance in TPLP.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Neuro-Argumentative Learning with Case-Based Reasoning
On the Structure of Game Provenance and its Applications
A Formalisation of Abstract Argumentation in Higher-Order Logic
Deep Learning for Abstract Argumentation Semantics
MisGAN: Learning from Incomplete Data with Generative Adversarial Networks
An argumentative agent-based model of scientific inquiry
토론
이 논문과 연결된 포럼 글이 아직 없습니다.