研究偏好论证框架的逆问题，快速判断是否存在满足特定标签的偏好关系。
On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation
- 提出从论证图和标签反推偏好关系的逆问题方法。
- 在四种主流偏好还原下，多数情况可在多项式时间内求解。
- 适用于偏好获取与解释性分析，提升论证系统的可理解性。
偏好型论证框架（PAFs）在Dung抽象论证框架（AAFs）基础上引入对论点的偏好，通过偏好将攻击转化为击败。不同处理方式导致不同的PAF到AAFs的还原。本文研究一个逆问题：给定论证图、标签及语义，判断是否存在一种偏好关系，使得还原后能产生目标标签。该问题在偏好获取与可解释性等领域有重要应用。我们针对四种最常用的基于偏好的还原方法，在完整语义下进行研究，证明在大多数情况下该问题可在多项式时间内解决。
原文摘要 · Abstract (English)
Preference-based argumentation frameworks (PAFs) extend Dung's approach to abstract argumentation (AAFs) by encoding preferences over arguments. Such preferences control the transformation of attacks into defeats, and different approaches to doing so result in different reductions from a PAF to an AAF. In this paper we consider a PAF inverse problem which takes an argumentation graph, a labelling and a semantics as an input, and outputs a ``yes" or ``no" as to whether there is a preference relation between the arguments which can yield the desired labelling. This inverse problem has applications in areas including preference elicitation and explainability. We consider this problem in the context of the four most widely-used preference based reductions under the complete semantics. We show that in most cases, the problem can be answered in polynomial time.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。