Polynomial-Time Solution for Preference-Based Argumentation Inverse Problem

A new paper in computer science addresses the inverse problem for preference-based argumentation frameworks (PAFs), which extend Dung's abstract argumentation frameworks (AAFs) by incorporating preferences over arguments. The problem takes an argumentation graph, a labelling, and a semantics as input and determines whether a preference relation exists that yields the desired labelling. This has applications in preference elicitation and explainability. The study examines the four most widely used preference-based reductions under complete semantics and shows that in most cases the problem can be solved in polynomial time.