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

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.