提出论点集合可接受程度的排序框架，让论点集更易比较优劣。
Extension-ranking Semantics for Abstract Argumentation Preprint
- 基于论点可接受性提出集合排序新方法，定义论点集间亲疏关系。
- 构建多组基础关系组合，形成多样化的排序语义体系。
- 适用于逻辑推理与论点评估，适合研究论证系统者参考。
本文提出一种通用框架，用于在抽象论证中对论点集合按其可接受性进行排序。该框架将杜恩（Dung）的扩展语义推广为扩展排序语义，对所有论点的幂集建立预序关系，从而可判断一个论点集比另一个更接近可接受。为评估该排序语义的合理性，我们引入多项原则要求。通过组合若干简单基础关系，每类关系代表论证推理的一个核心方面，形成一组扩展排序语义。同时，我们将文献中多个扩展排序方法适配至本框架，并评估其行为表现。
原文摘要 · Abstract (English)
In this paper, we present a general framework for ranking sets of arguments in abstract argumentation based on their plausibility of acceptance. We present a generalisation of Dung's extension semantics as extension-ranking semantics, which induce a preorder over the power set of all arguments, allowing us to state that one set is "closer" to being acceptable than another. To evaluate the extension-ranking semantics, we introduce a number of principles that a well-behaved extension-ranking semantics should satisfy. We consider several simple base relations, each of which models a single central aspect of argumentative reasoning. The combination of these base relations provides us with a family of extension-ranking semantics. We also adapt a number of approaches from the literature for ranking extensions to be usable in the context of extension-ranking semantics, and evaluate their behaviour.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。