Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach

Peer reviewe

Dynamics in Abstract Argumentation Frameworks with Recursive Attack and Support Relations

Argumentation is an important topic in the field of AI. There is a substantial amount of work about different aspects of Dung's abstract Argumentation Framework (AF). Two relevant aspects considered separately so far are extending the framework to account for recursive attacks and supports, and considering dynamics, i.e., AFs evolving over time. In this paper, we jointly deal with these two aspects.We focus on Attack-Support Argumentation Frameworks (ASAFs) which allow for attack and support relations not only between arguments but also targeting attacks and supports at any level, and propose an approach for the incremental computation of extensions (sets of accepted arguments, attacks and supports) of updated ASAFs. Our approach assumes that an initial ASAF extension is given and uses it for first checking whether updates are irrelevant; for relevant updates, an extension of an updated ASAF is computed by translating the problem to the AF domain and leveraging on AF solvers. We experimentally show our incremental approach outperforms the direct computation of extensions for updated ASAFs.Fil: Alfano, Gianvincenzo. Universita Della Calabria.; ItaliaFil: Cohen, Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; ArgentinaFil: Gottifredi, Sebastian. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; ArgentinaFil: Greco, Sergio. Universita Della Calabria.; ItaliaFil: Parisi, Francesco. Universita Della Calabria.; ItaliaFil: Simari, Guillermo R.. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina24th European Conference on Artificial IntelligenceSantiago de CompostelaEspañaEuropean Association for Artificial IntelligenceUniversidad de Santiago de Compostel

μ-toksia: An Efficient Abstract Argumentation Reasoner

Peer reviewe

Change in abstract bipolar argumentation systems (SUM 2015)

International audienceAn argumentation system can undergo changes (addition or removal of arguments/interactions), particularly in multiagent systems. In this paper, we are interested in dynamics of abstract bipolar argumentation systems, i.e. argumentation systems using two kinds of interaction: attacks and supports. We propose change characterizations that use and extend previous results defined in the case of Dung abstract argumentation systems

Multi-Context Reasoning in Continuous Data-Flow Environments

The field of artificial intelligence, research on knowledge representation and reasoning has originated a large variety of formats, languages, and formalisms. Over the decades many different tools emerged to use these underlying concepts. Each one has been designed with some specific application in mind and are even used nowadays, where the internet is seen as a service to be sufficient for the age of Industry 4.0 and the Internet of Things. In that vision of a connected world, with these many different formalisms and systems, a formal way to uniformly exchange information, such as knowledge and belief is imperative. That alone is not enough, because even more systems get integrated into the online world and nowadays we are confronted with a huge amount of continuously flowing data. Therefore a solution is needed to both, allowing the integration of information and dynamic reaction to the data which is provided in such continuous data-flow environments. This work aims to present a unique and novel pair of formalisms to tackle these two important needs by proposing an abstract and general solution. We introduce and discuss reactive Multi-Context Systems (rMCS), which allow one to utilise different knowledge representation formalisms, so-called contexts which are represented as an abstract logic framework, and exchange their beliefs through bridge rules with other contexts. These multiple contexts need to mutually agree on a common set of beliefs, an equilibrium of belief sets. While different Multi-Context Systems already exist, they are only solving this agreement problem once and are neither considering external data streams, nor are they reasoning continuously over time. rMCS will do this by adding means of reacting to input streams and allowing the bridge rules to reason with this new information. In addition we propose two different kind of bridge rules, declarative ones to find a mutual agreement and operational ones for adapting the current knowledge for future computations. The second framework is more abstract and allows computations to happen in an asynchronous way. These asynchronous Multi-Context Systems are aimed at modelling and describing communication between contexts, with different levels of self-management and centralised management of communication and computation. In this thesis rMCS will be analysed with respect to usability, consistency management, and computational complexity, while we will show how asynchronous Multi-Context Systems can be used to capture the asynchronous ideas and how to model an rMCS with it. Finally we will show how rMCSs are positioned in the current world of stream reasoning and that it can capture currently used technologies and therefore allows one to seamlessly connect different systems of these kinds with each other. Further on this also shows that rMCSs are expressive enough to simulate the mechanics used by these systems to compute the corresponding results on its own as an alternative to already existing ones. For asynchronous Multi-Context Systems, we will discuss how to use them and that they are a very versatile tool to describe communication and asynchronous computation

On the input/output behavior of argumentation frameworks

This paper tackles the fundamental questions arising when looking at argumentation frameworks as interacting components, characterized by an Input/Output behavior, rather than as isolated monolithical entities. This modeling stance arises naturally in some application contexts, like multi-agent systems, but, more importantly, has a crucial impact on several general application-independent issues, like argumentation dynamics, argument summarization and explanation, incremental computation, and inter-formalism translation. Pursuing this research direction, the paper introduces a general modeling approach and provides a comprehensive set of theoretical results putting the intuitive notion of Input/Output behavior of argumentation frameworks on a solid formal ground. This is achieved by combining three main ingredients. First, several novel notions are introduced at the representation level, notably those of argumentation framework with input, of argumentation multipole, and of replacement of multipoles within a traditional argumentation framework. Second, several relevant features of argumentation semantics are identified and formally characterized. In particular, the canonical local function provides an input-aware semantics characterization and a suite of decomposability properties are introduced, concerning the correspondences between semantics outcomes at global and local level. The third ingredient glues the former ones, as it consists of the investigation of some semantics-dependent properties of the newly introduced entities, namely S-equivalence of multipoles, S-legitimacy and S-safeness of replacements, and transparency of a semantics with respect to replacements. Altogether they provide the basis and draw the limits of sound interchangeability of multipoles within traditional frameworks. The paper develops an extensive analysis of all the concepts listed above, covering seven well-known literature semantics and taking into account various, more or less constrained, ways of partitioning an argumentation framework. Diverse examples, taken from the literature, are used to illustrate the application of the results obtained and, finally, an extensive discussion of the related literature is provided

Advanced Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving

dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novel algorithms which make use of these insights, and (iii) implementing these algorithms via (multiple) calls to SAT solvers. An empirical evaluation of the resulting implementation on ADF benchmarks generated from ICCMA competitions shows that our solver is able to outperform state-of-the-art ADF systems. (c) 2022 The Author(s). Published by Elsevier B.V.Peer reviewe