On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation

Computer Science > Artificial Intelligence arXiv:2604.22958 (cs) [Submitted on 24 Apr 2026] Title:On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation Authors:Alessio Zaninotto, Bruno Yun, Nir Oren, Srdjan Vesic View a PDF of the paper titled On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation, by Alessio Zaninotto and 3 other authors View PDF HTML (experimental) 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. 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. Comments: 14 pages, 2 figures Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2604.22958 [cs.AI] (or arXiv:2604.22958v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2604.22958 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Alessio Zaninotto [view email] [v1] Fri, 24 Apr 2026 19:01:57 UTC (46 KB) Full-text links: Access Paper: View a PDF of the paper titled On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation, by Alessio Zaninotto and 3 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: cs.AI < prev | next > new | recent | 2026-04 Change to browse by: cs References & Citations NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have…

This excerpt is published under fair use for community discussion. Read the full article at arXiv.org.