Autor:	Kiesel, Rafael, Rapberger, Anna
Rok vydání:	2021
Předmět:	Computer Science - Logic in Computer Science
Druh dokumentu:	Working Paper
Popis:	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).
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2112.10445 Zobrazit plný text záznamu View this record from Arxiv