# Paracoherent Answer Set Semantics meets Argumentation Frameworks

## TL;DR

This paper explores paracoherent extensions in argumentation frameworks, linking them to paracoherent answer set semantics, and compares their computational properties with semi-stable and stage semantics.

## Contribution

It introduces paracoherent extensions for incoherent AFs and analyzes their relation to existing semantics and answer set semantics, highlighting computational efficiency and symmetry.

## Key findings

- Paracoherent extensions correspond to paracoherent answer set semantics.
- Computational costs of paracoherent extensions are comparable to semi-stable and stage semantics.
- Paracoherent perspective offers a symmetric behavior in argumentation semantics.

## 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. Under consideration for acceptance in TPLP.