Researchers have explored an inverse problem within preference-based argumentation frameworks (PAFs), which extend standard argumentation by incorporating preferences over arguments. This inverse problem aims to determine if a specific preference relation exists that can produce a given argumentation graph, labeling, and semantics. The study focuses on four common preference-based reductions under complete semantics, finding that the problem is solvable in polynomial time for most cases. AI
Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →
IMPACT Introduces a novel inverse problem in argumentation theory with potential applications in preference elicitation and explainability.
RANK_REASON This is a research paper published on arXiv concerning a theoretical problem in argumentation frameworks.