Block Argumentation

01/18/2019
by   Ryuta Arisaka, et al.
0

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 have validated C. Argumentation involving such arguments requires us to potentially consider an argument as a coherent block of argumentation, i.e. an argument may itself be an argumentation. In this work, we formulate block argumentation as a specific instance of Dung-style bipolar abstract argumentation with the dual nature of arguments. We consider internal consistency of an argument(ation) under a set of constraints, of graphical (syntactic) and of semantic nature, and formulate acceptability semantics in relation to them. We discover that classical acceptability semantics do not in general hold good with the constraints. In particular, acceptability of unattacked arguments is not always warranted. Further, there may not be a unique minimal member in complete semantics, thus sceptic (grounded) semantics may not be its subset. To retain set-theoretically minimal semantics as a subset of complete semantics, we define semi-grounded semantics. Through comparisons, we show how the concept of block argumentation may further generalise structured argumentation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2023

Ranking-based Argumentation Semantics Applied to Logical Argumentation (full version)

In formal argumentation, a distinction can be made between extension-bas...
research
01/16/2014

Change in Abstract Argumentation Frameworks: Adding an Argument

In this paper, we address the problem of change in an abstract argumenta...
research
02/05/2018

Abstractly Interpreting Argumentation Frameworks for Sharpening Extensions

Cycles of attacking arguments pose non-trivial issues in Dung style argu...
research
05/07/2020

Technical Report of "Deductive Joint Support for Rational Unrestricted Rebuttal"

In ASPIC-style structured argumentation an argument can rebut another ar...
research
02/02/2017

Two forms of minimality in ASPIC+

Many systems of structured argumentation explicitly require that the fac...
research
04/07/2022

Strong Admissibility, a Tractable Algorithmic Approach (proofs)

Much like admissibility is the key concept underlying preferred semantic...
research
07/07/2021

Contrastive Explanations for Argumentation-Based Conclusions

In this paper we discuss contrastive explanations for formal argumentati...

Please sign up or login with your details

Forgot password? Click here to reset