On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation
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 reduction...
ArXiv CS.AI
Source
Generated insight by OnAirToday AI
This research tackles a crucial inverse problem in AI argumentation, determining if a given argumentation state can be achieved through specific preferences. Solving this efficiently has significant implications for understanding and explaining AI decision-making, particularly in preference-based systems.
Get the day's AI news in one short email. Free.
Subscribe to our Free AI Newsletter
The Daily AI Digest, every morning. Pick your topics after you subscribe.
Free. Unsubscribe anytime.
Comments
Keep comments relevant and respectful. No links, advertising, self-promotion, or spam.