DeepAI AI Chat
Log In Sign Up

Weakly Complete Semantics Based on Undecidedness Blocking

by   Pierpaolo Dondio, et al.

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 an attacking argument is not always propagated to an otherwise accepted attacked argument. The new semantics are conflict-free, non-admissible but employing a weaker notion of admissibility; they allow reinstatement and they retain the majority of properties of complete semantics. We show how both weakly complete and Dung's complete semantics can be generated by applying different undecidedness blocking strategies, making undecidedness blocking a unifying mechanism underlying argumentation semantics. The semantics are also an example of ambiguity blocking Dunganian semantics and the first semantics to tackle the problem of self-defeating attacking arguments. In the last part of the paper we compare weakly complete semantics with the recent work of Baumann et al. on weakly admissible semantics. Since the two families of semantics do not coincide, a principle-based analysis of the two approaches is provided. The analysis shows how our semantics satisfy a number of principles satisfied by Dung's complete semantics but not by Baumann et al. semantics, including directionality, abstention, SCC-decomposability and cardinality of extensions, making them a more faithful non-admissible version of Dung' semantics.


page 1

page 2

page 3

page 4


Credulous and Skeptical Argument Games for Complete Semantics in Conflict Resolution based Argumentation

Argumentation is one of the most popular approaches of defining a non-mo...

Some Supplementaries to The Counting Semantics for Abstract Argumentation

Dung's abstract argumentation framework consists of a set of interacting...

Broadening Label-based Argumentation Semantics with May-Must Scales

The semantics as to which set of arguments in a given argumentation grap...

The Equational Approach to CF2 Semantics

We introduce a family of new equational semantics for argumentation netw...

On graded semantics of abstract argumentation: Extension-based case

Based on Grossi and Modgil's recent work [1], this paper considers some ...

Inferring Attack Relations for Gradual Semantics

A gradual semantics takes a weighted argumentation framework as input an...

Concurrence for well-formed CAFs: Naive Semantics

In the area of claim-based reasoning in abstract argumentation, a claim-...