Concurrence for well-formed CAFs: Naive Semantics
Logic in Computer Science
2021-12-21 v1
Abstract
In the area of claim-based reasoning in abstract argumentation, a claim-based semantics is said to be concurrent in a given framework if all its variants yield the same extensions. In this note, we show that the concurrence problem with respect to naive semantics is coNP-hard for well-formed CAFs. This solves a problem that has been left open in Dvor\'ak et al. (2021).
Keywords
Cite
@article{arxiv.2112.10445,
title = {Concurrence for well-formed CAFs: Naive Semantics},
author = {Rafael Kiesel and Anna Rapberger},
journal= {arXiv preprint arXiv:2112.10445},
year = {2021}
}