Dung's semantics satisfy attack removal monotonicity
CNRS（法国国家科学研究中心）；IRIT（法国信息与通信研究所）；CRIL（法国里尔计算机研究实验室）；Univ. Artois（阿图瓦大学）
英文摘要：
We show that preferred, stable, complete, and grounded semantics satisfy attack removal monotonicity. This means that if an attack from b to a is removed, the status of a cannot worsen, e.g. if a was skeptically accepted, it cannot become rejected.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
