On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation
On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation
关于论证中基于偏好的归约逆解存在性的研究
Abstract: 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.
摘要： 基于偏好的论证框架（PAFs）通过对论证进行偏好编码，扩展了 Dung 的抽象论证（AAFs）方法。这些偏好控制着攻击向失败的转化，而不同的转化方法会导致从 PAF 到 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.
在本文中，我们考虑了一个 PAF 逆问题，该问题以论证图、标注和语义作为输入，并输出“是”或“否”，以判断是否存在一种能够产生所需标注的论证间偏好关系。这一逆问题在偏好诱导和可解释性等领域具有应用价值。
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.
我们在完全语义下，针对四种最广泛使用的基于偏好的归约方法探讨了这一问题。研究表明，在大多数情况下，该问题可以在多项式时间内得到解答。
Paper Details:
- Authors: Alessio Zaninotto, Bruno Yun, Nir Oren, Srdjan Vesic
- Subject: Artificial Intelligence (cs.AI)
- arXiv ID: 2604.22958
- Submission Date: 24 Apr 2026
论文详情：
- 作者： Alessio Zaninotto, Bruno Yun, Nir Oren, Srdjan Vesic
- 学科： 人工智能 (cs.AI)
- arXiv ID： 2604.22958
- 提交日期： 2026年4月24日