Ranking Semantics Based on Subgraphs Analysis

Pierpaolo Dondio

doi:10.21427/9hcs-1s56

Ranking Semantics Based on Subgraphs Analysis

Pierpaolo Dondio

School of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

An abstract argumentation framework [15] consists of a direct graph where nodes represent arguments and arrows represent an attack relation among arguments. A semantics is used to evaluate arguments’ acceptability. In the labelling approach [7], this evaluation is done by assigning to each argument a label in, out or undec, meaning that the argument is considered consistently acceptable, non-acceptable or undecided (i.e. no decision can be taken on arguments’ acceptability).

Original language	English
DOIs	https://doi.org/10.21427/9hcs-1s56
Publication status	Published - 2018
Event	17th International Conference on Autonomous Agents and Multiagent Systems - Stockholm, Sweden Duration: 10 Jul 2018 → 15 Jul 2018

Conference

Conference	17th International Conference on Autonomous Agents and Multiagent Systems
Country/Territory	Sweden
City	Stockholm
Period	10/07/18 → 15/07/18
Other	AAMAS 2018

Keywords

abstract argumentation framework
direct graph
arguments
attack relation
semantics
labelling approach
arguments’ acceptability

Access to Document

10.21427/9hcs-1s56Licence: CC BY-NC-SA

Cite this

@conference{a525d4cf984c44d59e2ed6e037755e89,

title = "Ranking Semantics Based on Subgraphs Analysis",

abstract = "An abstract argumentation framework [15] consists of a direct graph where nodes represent arguments and arrows represent an attack relation among arguments. A semantics is used to evaluate arguments{\textquoteright} acceptability. In the labelling approach [7], this evaluation is done by assigning to each argument a label in, out or undec, meaning that the argument is considered consistently acceptable, non-acceptable or undecided (i.e. no decision can be taken on arguments{\textquoteright} acceptability).",

keywords = "abstract argumentation framework, direct graph, arguments, attack relation, semantics, labelling approach, arguments{\textquoteright} acceptability",

author = "Pierpaolo Dondio",

year = "2018",

doi = "10.21427/9hcs-1s56",

language = "English",

note = "17th International Conference on Autonomous Agents and Multiagent Systems ; Conference date: 10-07-2018 Through 15-07-2018",

}

TY - CONF

T1 - Ranking Semantics Based on Subgraphs Analysis

AU - Dondio, Pierpaolo

PY - 2018

Y1 - 2018

N2 - An abstract argumentation framework [15] consists of a direct graph where nodes represent arguments and arrows represent an attack relation among arguments. A semantics is used to evaluate arguments’ acceptability. In the labelling approach [7], this evaluation is done by assigning to each argument a label in, out or undec, meaning that the argument is considered consistently acceptable, non-acceptable or undecided (i.e. no decision can be taken on arguments’ acceptability).

AB - An abstract argumentation framework [15] consists of a direct graph where nodes represent arguments and arrows represent an attack relation among arguments. A semantics is used to evaluate arguments’ acceptability. In the labelling approach [7], this evaluation is done by assigning to each argument a label in, out or undec, meaning that the argument is considered consistently acceptable, non-acceptable or undecided (i.e. no decision can be taken on arguments’ acceptability).

KW - abstract argumentation framework

KW - direct graph

KW - arguments

KW - attack relation

KW - semantics

KW - labelling approach

KW - arguments’ acceptability

U2 - 10.21427/9hcs-1s56

DO - 10.21427/9hcs-1s56

M3 - Paper

T2 - 17th International Conference on Autonomous Agents and Multiagent Systems

Y2 - 10 July 2018 through 15 July 2018

ER -

Ranking Semantics Based on Subgraphs Analysis

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this