Research3h ago
New Inverse Solution For Preference-Based Argumentation
A new paper on arXiv addresses the PAF inverse problem by determining if a specific preference relation can produce a desired labeling. The researchers analyze four widely-used frameworks to enable better preference elicitation. This technical approach improves explainability in automated reasoning. Practitioners can now verify if specific argument outcomes are logically possible under preference constraints.