From User Preferences to Base Score Extraction Functions in Gradual Argumentation (with Appendix)

arXiv:2602.14674v4 Announce Type: replace
Abstract: Gradual argumentation is a field of symbolic AI which is attracting attention for its ability to support transparent and contestable AI systems. It is considered a useful tool in domains such as decision-making, recommendation, debate analysis, and others. The outcomes in such domains are usually dependent on the arguments’ base scores, which must be selected carefully. Often, this selection process requires user expertise and may not always be straightforward. On the other hand, organising the arguments by preference could simplify the task. In this work, we introduce emphBase Score Extraction Functions, which provide a mapping from users’ preferences over arguments to base scores. These functions can be applied to the arguments of a emphBipolar Argumentation Framework (BAF), supplemented with preferences, to obtain a emphQuantitative Bipolar Argumentation Framework (QBAF), allowing the use of well-established computational tools in gradual argumentation. We outline the desirable properties of base score extraction functions, discuss some design choices, and provide an algorithm for base score extraction. Our method incorporates an approximation of non-linearities in human preferences to allow for better approximation of the real ones. Finally, we evaluate our approach both theoretically and experimentally in a robotics setting, and offer recommendations for selecting appropriate gradual semantics in practice.