格式良好的CAF的并发:朴素语义
Concurrence for well-formed CAFs: Naive Semantics
摘要:
在抽象论证中的基于声明的推理领域,如果基于声明的语义的所有变体产生相同的扩展,则在给定的框架中,基于声明的语义被称为是并发的。在这篇文章中,我们证明了对于形式良好的CAF,关于朴素语义的并发问题是CONP困难的。这解决了Dvorák et al.(2021)中遗留的问题。
英文摘要:
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ák et al. (2021).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。