Theoretical Analysis and Implementation of Abstract Argumentation Frameworks with Domain Assignments

G. Flouris, Th. Patkos, A. Bikakis, A. Vassiliades, N. Bassiliades, D. Plexousakis, “Theoretical Analysis and Implementation of Abstract Argumentation Frameworks with Domain Assignments”, International Journal of Approximate Reasoning, Volume 161, October 2023, 108992.

G. Flouris, Th. Patkos, A. Bikakis, A. Vassiliades, N. Bassiliades, D. Plexousakis

Abstract argumentation frameworks; Argument domain of application; Non-monotonic reasoning; Logic programming

A representational limitation of current argumentation frameworks is their inability to deal with sets of entities and their properties, for example to express that an argument is applicable for a specific set of entities that have a certain property and not applicable for all the others. In order to address this limitation, we recently introduced Abstract Argumentation Frameworks with Domain Assignments (AAFDs), which extend Abstract Argumentation Frameworks (AAFs) by assigning to each argument a domain of application, i.e., a set of entities for which the argument is believed to apply. We provided formal definitions of AAFDs and their semantics, showed with examples how this model can support various features of commonsense and non-monotonic reasoning, and studied its relation to AAFs. In this paper, aiming to provide a deeper insight into this new model, we present more results on the relation between AAFDs and AAFs and the properties of the AAFD semantics, and we introduce an alternative, more expressive way to define the domains of arguments using logical predicates. We also offer an implementation of AAFDs based on Answer Set Programming (ASP) and evaluate it using a range of experiments with synthetic datasets.