English
Related papers

Related papers: Tenability and Weak Semantics: Modeling Non-unifor…

200 papers

In this paper we introduce a novel semantics, called defense semantics, for Dung's abstract argumentation frameworks in terms of a notion of (partial) defence, which is a triple encoding that one argument is (partially) defended by another…

Artificial Intelligence · Computer Science 2023-11-23 Beishui Liao , Leendert van der Torre

Dung's abstract framework for argumentation enables a study of the interactions between arguments based solely on an ``attack'' binary relation on the set of arguments. Various ways to solve conflicts between contradictory pieces of…

Artificial Intelligence · Computer Science 2007-05-23 C. Cayrol , S. Doutre , M. -C. Lagasquie-Schiex , J. Mengin

Dung's abstract argumentation framework consists of a set of interacting arguments and a series of semantics for evaluating them. Those semantics partition the powerset of the set of arguments into two classes: extensions and…

Artificial Intelligence · Computer Science 2015-09-14 Fuan Pu , Jian Luo , Guiming Luo

The paper develops a formal theory of the degree of justification of arguments, which relies solely on the structure of an argumentation framework, and which can be successfully interfaced with approaches to instantiated argumentation. The…

Artificial Intelligence · Computer Science 2018-11-09 Davide Grossi , Sanjay Modgil

Weighted gradual semantics provide an acceptability degree to each argument representing the strength of the argument, computed based on factors including background evidence for the argument, and taking into account interactions between…

Artificial Intelligence · Computer Science 2024-08-21 Assaf Libman , Nir Oren , Bruno Yun

In this paper we introduce a novel family of semantics called weakly complete semantics. Differently from Dung's complete semantics, weakly complete semantics employs a mechanism called undecidedness blocking by which the label undecided of…

Logic in Computer Science · Computer Science 2021-03-22 Pierpaolo Dondio , Luca Longo

We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…

Artificial Intelligence · Computer Science 2019-01-21 Ryuta Arisaka , Stefano Bistarelli , Francesco Santini

Dung's abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations. Hereby, the knowledge is represented by so-called argumentation frameworks (AFs) and the reasoning…

Artificial Intelligence · Computer Science 2016-04-01 Ringo Baumann , Thomas Linsbichler , Stefan Woltran

In Dung's abstract argumentation, arguments are either acceptable or unacceptable, given a chosen notion of acceptability. This gives a coarse way to compare arguments. In this paper, we propose a counting approach for a more fine-gained…

Artificial Intelligence · Computer Science 2015-07-21 Fuan Pu , Jian Luo , Yulai Zhang , Guiming Luo

A gradual semantics takes a weighted argumentation framework as input and outputs a final acceptability degree for each argument, with different semantics performing the computation in different manners. In this work, we consider the…

Artificial Intelligence · Computer Science 2023-02-09 Nir Oren , Bruno Yun

Recently, Strength-based Argumentation Frameworks (StrAFs) have been proposed to model situations where some quantitative strength is associated with arguments. In this setting, the notion of accrual corresponds to sets of arguments that…

Artificial Intelligence · Computer Science 2022-07-07 Yohann Bacquey , Jean-Guy Mailly , Pavlos Moraitis , Julien Rossit

In this paper, we present a general framework for ranking sets of arguments in abstract argumentation based on their plausibility of acceptance. We present a generalisation of Dung's extension semantics as extension-ranking semantics, which…

Artificial Intelligence · Computer Science 2025-05-01 Kenneth Skiba , Tjitze Rienstra , Matthias Thimm , Jesse Heyninck , Gabriele Kern-Isberner

We show that preferred, stable, complete, and grounded semantics satisfy attack removal monotonicity. This means that if an attack from b to a is removed, the status of a cannot worsen, e.g. if a was skeptically accepted, it cannot become…

Artificial Intelligence · Computer Science 2020-07-09 Leila Amgoud , Srdjan Vesic

Abstract argumentation provides us with methods such as gradual and Dung semantics with which to evaluate arguments after potential attacks by other arguments. Some of these methods can take intrinsic strengths of arguments as input, with…

Artificial Intelligence · Computer Science 2021-09-02 Jeroen Paul Spaans

The notion of stability in a structured argumentation setup characterizes situations where the acceptance status associated with a given literal will not be impacted by any future evolution of this setup. In this paper, we abstract away…

Artificial Intelligence · Computer Science 2020-12-24 Jean-Guy Mailly , Julien Rossit

Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory, apparent behavioural difference between odd and even length cycles being a notable one. While a few methods were proposed for treating them, to - in…

Artificial Intelligence · Computer Science 2018-02-06 Ryuta Arisaka , Jeremie Dauphin

Argumentation is a promising model for reasoning with uncertain knowledge. The key concept of acceptability enables to differentiate arguments and counterarguments: The certainty of a proposition can then be evaluated through the most…

Artificial Intelligence · Computer Science 2013-02-01 Leila Amgoud , Claudette Cayrol

Dung's abstract argumentation frameworks model acceptability solely in terms of an attack relation, thereby conflating two conceptually distinct aspects of argumentative reasoning: direct conflict between arguments and the structural…

Artificial Intelligence · Computer Science 2026-04-14 Beishui Liao

Argumentation frameworks, consisting of arguments and an attack relation representing conflicts, are fundamental for formally studying reasoning under conflicting information. We use methods from mathematical logic, specifically…

Artificial Intelligence · Computer Science 2025-12-01 Uri Andrews , Luca San Mauro

One of the most prominent tools for abstract argumentation is the Dung's framework, AF for short. It is accompanied by a variety of semantics including grounded, complete, preferred and stable. Although powerful, AFs have their…

Artificial Intelligence · Computer Science 2014-05-05 Sylwia Polberg
‹ Prev 1 2 3 10 Next ›