DeepAI AI Chat
Log In Sign Up

Broadening Label-based Argumentation Semantics with May-Must Scales

by   Ryuta Arisaka, et al.

The semantics as to which set of arguments in a given argumentation graph may be acceptable (acceptability semantics) can be characterised in a few different ways. Among them, labelling-based approach allows for concise and flexible determination of acceptability statuses of arguments through assignment of a label indicating acceptance, rejection, or undecided to each argument. In this work, we contemplate a way of broadening it by accommodating may- and must- conditions for an argument to be accepted or rejected, as determined by the number(s) of rejected and accepted attacking arguments. We show that the broadened label-based semantics can be used to express more mild indeterminacy than inconsistency for acceptability judgement when, for example, it may be the case that an argument is accepted and when it may also be the case that it is rejected. We identify that finding which conditions a labelling satisfies for every argument can be an undecidable problem, which has an unfavourable implication to semantics. We propose to address this problem by enforcing a labelling to maximally respect the conditions, while keeping the rest that would necessarily cause non-termination labelled undecided.


page 1

page 2

page 3

page 4


Burden of Persuasion in Argumentation

This paper provides a formal model for the burden of persuasion in dialo...

Some Supplementaries to The Counting Semantics for Abstract Argumentation

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

Judgment Aggregation in Multi-Agent Argumentation

Given a set of conflicting arguments, there can exist multiple plausible...

Weakly Complete Semantics Based on Undecidedness Blocking

In this paper we introduce a novel family of semantics called weakly com...

Strong Admissibility, a Tractable Algorithmic Approach (proofs)

Much like admissibility is the key concept underlying preferred semantic...

Inferring Attack Relations for Gradual Semantics

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