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

Aniol Civit, Antonio Rago, Antonio Andriella, Guillem Alenyà, Francesca ToniarXiv 2026 · arXiv

TL;DR

This paper bridges the gap between qualitative human preferences and quantitative AI decision-making within gradual argumentation. By introducing Base Score Extraction Functions (BSEFs), the authors provide a principled way to automatically translate user preference orderings—including non-linear intensities—into numerical base scores for Quantitative Bipolar Argumentation Frameworks (QBAFs). This enables more intuitive, personalized, and transparent AI alignment, demonstrated here in an assistive robotics context.

What Problem Does This Paper Address?

In computational argumentation, AI systems make decisions by weighing conflicting arguments that either attack or support one another. A powerful sub-field known as gradual argumentation uses quantitative frameworks (QBAFs) where every argument is assigned an intrinsic numerical "base score" (representing its baseline strength). These scores are then processed through mathematical semantics to determine the final strength of potential decisions.

However, setting these exact numerical base scores is highly unintuitive for everyday users and domain experts alike. While humans struggle to assign precise numbers (e.g., "this argument is a 0.75"), they are excellent at expressing qualitative preferences (e.g., "I prefer argument A over argument B").

Furthermore, human preferences are inherently non-linear; we might slightly prefer A over B, but vastly prefer B over C. Existing methods lack a structured, axiomatic approach to map these qualitative, varying-intensity human preferences directly into the quantitative base scores required by gradual argumentation systems.

Methods

The authors introduce Base Score Extraction Functions (BSEFs) to mathematically map qualitative user preferences to quantitative base scores.

Methodology overview: Converting a BAF with user preferences into a QBAF using a Base Score Extraction Function ($\nu$).

Key components of their methodology include:

  • Modeling Non-Linearity: They extend standard preference orderings (indifference $\simeq$ and strict preference $\succ$) by introducing a "much more preferred" relation ($\succ\succ$) to capture varying intensities of human opinion.
  • Core Axioms: They establish three fundamental axioms that any valid BSEF must satisfy:
  • Preference Coherence: If an argument is preferred over another, its extracted base score must be strictly higher.
  • Preference Relation Coherence: The numerical gap between arguments separated by a "much more preferred" ($\succ\succ$) relation must be larger than a standard preference ($\succ$) relation.
  • Preference Structure Coherence: Distinct, non-isomorphic preference structures must yield distinct base score assignments.
  • Concrete BSEF Designs: They propose two distinct functions:
  • $\nu_1$ (Adaptable Range): Allows explicit manual setting of the upper ($\top$) and lower ($\bot$) score bounds.
  • $\nu_2$ (Adaptable Squeezing and Distancing): Uses parameters ($\alpha, \beta$) to compress scores or adjust their distance to the boundaries, making it highly robust when the total number of arguments is dynamic or unknown.
  • Algorithmic Pipeline: They present an algorithm that calculates relative qualitative "distances" between ranked arguments and normalizes them into valid base scores within the $[0, 1]$ range.

Datasets

The paper evaluates the proposed framework using two primary methods rather than standard pre-existing benchmarks:

  1. Simulated Assistive Robotics Use Case: A robotic feeding scenario where a robot must decide between a "slow" or "fast" feeding pace based on user-centric arguments (e.g., patient safety, boredom, anxiety, and social interaction).
  2. Synthetic Robustness Dataset: A dataset of 30,000 randomly generated samples of preference orderings and design choices, used to evaluate how consistently different argumentation semantics behave when fed with BSEF-generated scores.

Key Insights and Ideas

  • Rankings Dominate, Parameters Fine-Tune: The qualitative ordering provided by the user is the primary driver of the final AI decision. Numerical tuning parameters (like the preference ratio) act as fine-tuning mechanisms that adjust sensitivity rather than erratically flipping stable decisions.
  • Semantics Dictate Sensitivity: The choice of gradual semantics (how arguments aggregate influence) drastically changes how the system reacts to user preferences.
  • The Reactivity Spectrum: As illustrated in Figure 2, different semantics suit different applications:
  • DF-QuAD is highly reactive and easily dominated by a single highly preferred argument, making it suitable for safety-critical scenarios.
  • Quadratic Energy (QE) provides a smooth, balanced compromise between responsiveness and stability, ideal for explainable decision support.
  • Euler-Based (EB) is highly conservative, preserving extreme high-confidence arguments.
Figure 2: Influence of an argument’s base score and its supporters or attackers on the final argument strength under different gradual semantics. Each subplot corresponds to a distinct semantics: DF-QuAD (left), Quadratic Energy (centre), and the Euler-based Semantics (right). The x-axis represents the base score of the influenced argument, and the y-axis its resulting final strength. Blue lines denote when the influencing argument is a supporter (+), while red lines denote when it is an attacker (-). Each line has assigned its aggregation (𝛼), with colour intensity indicating its strength.

Key Results

  • Theoretical Proofs: The authors successfully proved mathematically that both $\nu_1$ and $\nu_2$ satisfy all core axioms and desirable properties (such as stability and regularity).
  • High Semantic Agreement: In the 30,000-trial simulation under centralized properties, the Quadratic Energy (QE) and Euler-Based (EB) semantics demonstrated an exceptionally high pairwise agreement of 98% ($\kappa = 0.96$). DF-QuAD diverged more (85% agreement with QE), highlighting its unique sensitivity to extreme base scores.
  • Successful Robot Alignment: In the assistive feeding simulation, the default system (without user preferences) chose an unsafe "fast" pace. Applying the BSEF successfully flipped the decision to a safe "slow" pace as soon as the user prioritized safety-related arguments, demonstrating effective human-AI alignment.

Limitations and Future Work

  • Acyclic Graphs Only: The current framework assumes acyclic argumentation structures (trees). Extending BSEFs to handle cyclic graphs is an open challenge.
  • Total Orderings Requirement: The algorithm currently expects a total ordering where all arguments can be compared. Future work will focus on accommodating partial orderings where some arguments are incomparable.
  • Single-User Focus: The method is designed around a single user's profile. Aggregating conflicting preferences from multiple users in a shared decision-making environment remains to be explored.
  • Empirical Validation: The robotics evaluation was simulated; the authors plan to conduct a comprehensive real-world user study to evaluate how intuitively humans interact with the extended preference relations.

Summary updated

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 \emph{Base 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 \emph{Bipolar Argumentation Framework} (BAF), supplemented with preferences, to obtain a \emph{Quantitative 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.
BibTeX
@misc{civit2026from,
  author = {Aniol Civit and Antonio Rago and Antonio Andriella and Guillem Alenyà and Francesca Toni},
  title = {{From User Preferences to Base Score Extraction Functions in Gradual Argumentation (with Appendix)}},
  year = {2026},
  eprint = {2602.14674},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2602.14674},
}
Figure