Credulous acceptance in high-order argumentation frameworks with necessities: An incremental approach

The Attack-Support Argumentation Framework (ASAF) is an abstract argumentation framework that provides a unified setting for representing attack and support for arguments, as well as attack and support for the attack and support relations at any level. Currently, the extensions of the ASAF are obtained by translating it into a Dung's Argumentation Framework (AF). In this work we provide the ASAF with the ability of determining its extensions without requiring such a translation. We follow an extension-based approach for characterizing the acceptability semantics directly on the ASAF, considering the complete, preferred, stable and grounded semantics. Finally, we show that the proposed characterization satisfies different results from Dung's argumentation theory.

Dung's argumentation framework is an abstract framework based on a set of arguments and a binary attack relation defined over the set. One instantiation, among many others, of Dung's framework consists in constructing the arguments from a set of propositional logic formulas. Thus an argument is seen as a reason for or against the truth of a particular statement. Despite its advantages, the argumentation approach for inconsistency handling also has important shortcomings. More precisely, in some applications what one is interested in are not so much only the conclusions supported by the arguments but also the precise explications of such conclusions. We show that argumentation framework applied to classical logic formulas is not suitable to deal with this problem. On the other hand, intuitionistic logic appears to be a natural alternative candidate logic (instead of classical logic) to instantiate Dung's framework. We develop constructive argumentation framework. We show that intuitionistic logic offers nice and desirable properties of the arguments. We also provide a characterization of the arguments in this setting in terms of minimal inconsistent subsets when intuitionistic logic is embedded in the modal logic S4.

We propose a logical encoding of extended abstract argumentation frameworks, that is frameworks with higher-order attacks (i.e. attacks whose targets are other attacks). Our purpose is to separate the logical expression of the meaning of an attack (simple or higher-order) from the logical expression of acceptability semantics. We consider semantics which specify the conditions under which the arguments (resp. the attacks) are considered as accepted, directly on the extended framework, without translating the original framework into a Dung's argumentation framework. We characterize the output of a given framework in logical terms (namely as particular models of a logical theory). Our proposal applies to the particular case of Dung's frameworks, enabling to recover standard extensions.

The system ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung's argumentation framework and generalizations thereof. ASPARTIX relies on a fixed disjunctive datalog program which takes an instance of an argumentation framework as input, and uses the answer-set solver DLV for computing the type of extension specified by the user.

Argumentative reasoning and taxonomic analysis for the identification of medical errors

This paper reconsiders Modgil's Extended Argumentation Frameworks EAFs that extend Dung's abstract argumentation frameworks by attacks on attacks. This allows to encode preferences directly in the framework and thus also to reason about the preferences themselves. As a first step to reduction-based approaches to implement EAFs, we give an alternative but equivalent characterization of acceptance in EAFs. Then we use this characterization to provide EAF encodings for answer set programming and propositional logic. Moreover, we address an open complexity question and the expressiveness of EAFs.

An abstract framework for structured arguments is presented, which instantiates Dung's (‘On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming, and n-Person Games’, Artificial Intelligence, 77, 321–357) abstract argumentation frameworks. Arguments are defined as inference trees formed by applying two kinds of inference rules: strict and defeasible rules. This naturally leads to three ways of attacking an argument: attacking a premise, attacking a conclusion and attacking an inference. To resolve such attacks, preferences may be used, which leads to three corresponding kinds of defeat: undermining, rebutting and undercutting defeats. The nature of the inference rules, the structure of the logical language on which they operate and the origin of the preferences are, apart from some basic assumptions, left unspecified. The resulting framework integrates work of Pollock, Vreeswijk and others on the structure of arguments and the nature of defeat and extends it in several respects. Various rationality postulates are proved to be satisfied by the framework, and several existing approaches are proved to be a special case of the framework, including assumption-based argumentation and DefLog.

Argument-based reasoning offers promising interaction and computation mechanisms for multi-agent negotiation and deliberation. Arguments in this context are typically statements of beliefs or actions related to agents' subjective values, preferences and so on. Consequences of such arguments can and should be evaluated using various criteria, and therefore it is desirable that semantics supports these criteria as principles for accepting arguments. This article gives an instance of Dung's abstract argumentation framework to deal with Pareto optimality, i.e. a fundamental criterion for social welfare. We show that the instance allows Dung's acceptability semantics to interpret Pareto optimal arguments, without loss of generality. We discuss the prospects of justified Pareto optimal arguments and Pareto optimal extensions.

The field of explainable AI has grown exponentially in recent years. Within this landscape, argumentation frameworks have shown to be helpful abstractions of some AI models towards providing explanations thereof. While existing work on argumentative explanations and their properties has focused on static settings, we focus on dynamic settings whereby the (AI models underpinning the) argumentation frameworks need to change. Specifically, for a number of notions of explanations drawn from abstract argumentation frameworks under extension-based semantics, we address the following questions: (1) Are explanations robust to extension-preserving changes, in the sense that they are still valid when the changes do not modify the extensions? (2) If not, are these explanations pseudo-robust in that can be tractably updated? In this paper, we frame these questions formally. We consider robustness and pseudo-robustness w.r.t. ordinary and strong equivalence and provide several results for various extension-based semantics.

In this paper we further progress the analysis of the recently introduced multi-valued argumentation frameworks (MVAFs). MVAFs are an extension of Dung's abstract argumentation, where arguments have a degree of truth associated with them. Here we describe a list of properties of MVAFs considering the major multi-valued logics such as those proposed by Gödel, Zadeh and Łukasiewicz. We then propose a computational framework that joins multi-valued and probabilistic argumentation frameworks to handle situations where arguments affected by vagueness and/or probabilities coexist. The findings are a contribution to the field of non-monotonic approximate reasoning and they also represent a well-grounded proposal towards the introduction of gradualism in argumentation systems.

In this paper, we investigate the revision issue for Dung argumentation frameworks. The main idea is that such frameworks can be translated into propositional formulae, allowing the use of propositional revision operators to perform a rational minimal change. Our translation-based approach to revising argumentation frameworks can take advantage of any propositional revision operator ∘. Via a translation, each propositional operator ∘ can be associated with some revision operators ⋆ suited to argumentation frameworks. Some rationality postulates for the ⋆ operators are presented. If the revision formulae are restricted to formulae about acceptance statuses, some ⋆ operators satisfy these postulates provided that the corresponding ∘ operator is AGM.

Claim-augmented argumentation frameworks (CAFs) constitute a generic formalism for conflict resolution of conclusion-oriented problems in argumentation. CAFs extend Dung argumentation frameworks (AFs) by assigning a claim to each argument. So far, semantics for CAFs are defined with respect to the underlying AF by interpreting the extensions of the respective AF semantics in terms of the claims of the accepted arguments; we refer to them as inherited semantics of CAFs.<br>A central concept of many argumentation semantics is maximization, which can be done with respect to arguments as in preferred semantics, or with respect to the range as in semi-stable semantics. However, common instantiations of argumentation frameworks require maximality on the claim-level and inherited semantics often fail to provide maximal claim-sets even if the underlying AF semantics yields maximal argument sets. To address this issue, we investigate a different approach and introduce claim-level semantics (cl-semantics) for CAFs where maximization is performed on the claim-level. We compare these two approaches for five prominent semantics (preferred, naive, stable, semi-stable, and stage) and relate in total eleven CAF semantics to each other. Moreover, we show that for a certain subclass of CAFs, namely well-formed CAFs, the different versions of preferred and stable semantics coincide, which is not the case for the remaining semantics. We furthermore investigate a recently established translation between well-formed CAFs and SETAFs and show that, in contrast to the inherited naive, semi-stable and stage semantics, the cl-semantics correspond to the respective SETAF semantics. Finally, we investigate the expressiveness of the considered semantics in terms of their signatures.

The purpose of this work is to study a generalisation of Dung’s abstract argumentation frameworks that allows representing recursive attacks, that is, a class of attacks whose targets are other attacks. We do this by developing a theory of argumentation where the classic role of attacks in defeating arguments is replaced by a subset of them, which is “extension-dependent” and which, intuitively, represents a set of “valid attacks” with respect to the extension. The studied theory displays a conservative generalisation of Dung’s semantics (complete, preferred, stable and grounded) and also of its principles (conflict-freeness, acceptability and admissibility). Furthermore, despite its conceptual differences, we are also able to show that our theory agrees with the AFRA interpretation of recursive attacks for the complete, preferred, stable and grounded semantics and with a recent flattening method.

In this paper we propose a labelling based dialogue game for determining whether a single argument within a Dung argumentation framework is skeptically preferred. Our game consists of two phases, and determines the membership of a single argument within the extension, assuming optimal play by dialogue participants. In the first phase, one player attempts to advance arguments to construct an extension not containing the argument under consideration, while the second phase verifies that the extension is indeed a preferred one. Correctness within this basic game requires perfect play by both players, and we therefore also introduce an overarching game to overcome this limitation.

In this paper we extend the traditional Dung argumentation framework with cardinality constraints over the set of warranted arguments. This results in a new definition for argumentation semantics wherein arguments within an extension are both in some sense consistent and compliant with the constraints imposed on the system. After discussing the theoretical aspects of such a resource-bounded argumentation framework we describe its utility via an application to a concrete application domain: the scheduling of demand responsive transport.