The handling of loops in argumentation networks

Dov Gabbay

doi:10.1093/logcom/exu007

The handling of loops in argumentation networks

Dov Gabbay

CS@BIU

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

This article is about busting loops in abstract argumentation networks. We propose several approaches to how to deal with networks which have loops (such as even or odd cycles) and get new extensions which are 'in', 'out' extensions, with no undecided elements.

Original language	English
Pages (from-to)	1065-1147
Number of pages	83
Journal	Journal of Logic and Computation
Volume	26
Issue number	4
DOIs	https://doi.org/10.1093/logcom/exu007
State	Published - 1 Aug 2016

Bibliographical note

Publisher Copyright:
© 2014 The Author, 2014. Published by Oxford University Press.

Keywords

Argumentation networks
CF2 semantics
Shkop extensions
equational approach
loops

Access to Document

10.1093/logcom/exu007

Cite this

@article{2b1cb98b4bad4ad5a91f9b22aa3df1a7,

title = "The handling of loops in argumentation networks",

abstract = "This article is about busting loops in abstract argumentation networks. We propose several approaches to how to deal with networks which have loops (such as even or odd cycles) and get new extensions which are 'in', 'out' extensions, with no undecided elements.",

keywords = "Argumentation networks, CF2 semantics, Shkop extensions, equational approach, loops",

author = "Dov Gabbay",

note = "Publisher Copyright: {\textcopyright} 2014 The Author, 2014. Published by Oxford University Press.",

year = "2016",

month = aug,

day = "1",

doi = "10.1093/logcom/exu007",

language = "אנגלית",

volume = "26",

pages = "1065--1147",

journal = "Journal of Logic and Computation",

issn = "0955-792X",

publisher = "Oxford University Press",

number = "4",

}

TY - JOUR

T1 - The handling of loops in argumentation networks

AU - Gabbay, Dov

PY - 2016/8/1

Y1 - 2016/8/1

N2 - This article is about busting loops in abstract argumentation networks. We propose several approaches to how to deal with networks which have loops (such as even or odd cycles) and get new extensions which are 'in', 'out' extensions, with no undecided elements.

AB - This article is about busting loops in abstract argumentation networks. We propose several approaches to how to deal with networks which have loops (such as even or odd cycles) and get new extensions which are 'in', 'out' extensions, with no undecided elements.

KW - Argumentation networks

KW - CF2 semantics

KW - Shkop extensions

KW - equational approach

KW - loops

UR - http://www.scopus.com/inward/record.url?scp=84982182504&partnerID=8YFLogxK

U2 - 10.1093/logcom/exu007

DO - 10.1093/logcom/exu007

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84982182504

SN - 0955-792X

VL - 26

SP - 1065

EP - 1147

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

IS - 4

ER -

The handling of loops in argumentation networks

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this