Some Results about the Expressivity of Preference-Incomplete Structured Argumentation Frameworks

2026-06-22Artificial Intelligence

Artificial IntelligenceLogic in Computer Science
AI summary

The authors examine how well ASPIC+ argumentation frameworks can represent uncertain preferences by comparing them to other abstract models that handle uncertain conflicts. They find mostly negative results, meaning ASPIC+ may not express these uncertainties as fully as expected. Despite this, the authors propose a hypothesis about when uncertain preferences could be more expressively powerful and take initial steps to support this idea.

ASPIC+argumentation frameworksuncertain preferencesexpressive powerabstract argumentationdefeatspreference profilesformal semanticscomputational models
Authors
Antonio Yuste-Ginel
Abstract
This paper studies the expressive power of ASPIC$^+$ argumentation frameworks with uncertain preference profiles by comparing them with several abstract formalisms with uncertain defeats. Most of our results are negative (and some of them are theoretically unexpected). We also conjecture a positive, non-trivial threshold for the expressivity of uncertain preferences, and prove some essential preliminary steps toward the confirmation of this conjecture.