Toward a More Efficient Generation of Structured Argumentation Graphs

Bruno Yun; Srdjan Vesic; Madalina Croitoru

doi:10.3233/978-1-61499-906-5-205

Toward a More Efficient Generation of Structured Argumentation Graphs

Bruno Yun, Srdjan Vesic, Madalina Croitoru

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

12 Citations (Scopus)

3 Downloads (Pure)

Abstract

To address the needs of the EU NoAW project, in this paper we solve the problem of efficiently generating the argumentation graphs from knowledge bases expressed using existential rules. For the knowledge bases without rules, we provide a methodology that allows to optimise the generation of argumentation graphs. For knowledge bases with rules, we show how to filter out a large number of arguments and reduce the number of attacks.

Original language	English
Title of host publication	Computational Models of Argument
Subtitle of host publication	Proceedings of COMMA 2018
Editors	Sanjay Modgil, Katarzyna Budzynska, John Lawrence
Publisher	IOS Press
Pages	205-212
Number of pages	8
ISBN (Electronic)	978-1-61499-906-5
ISBN (Print)	978-1-61499-905-8
DOIs	https://doi.org/10.3233/978-1-61499-906-5-205
Publication status	Published - 2018
Event	COMMA 2018 - Warsaw, Poland Duration: 12 Sept 2018 → 14 Sept 2018

Publication series

Name	Frontiers in Artificial Intelligence and Applications

Conference

Conference	COMMA 2018
Country/Territory	Poland
City	Warsaw
Period	12/09/18 → 14/09/18

Access to Document

10.3233/978-1-61499-906-5-205Licence: CC BY-NC

Yun_etal_FAIA305_VOR
© 2018 The authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0). https://creativecommons.org/licenses/by-nc/4.0/
Final published version, 254 KBLicence: CC BY-NC

Cite this

Toward a More Efficient Generation of Structured Argumentation Graphs. / Yun, Bruno; Vesic, Srdjan; Croitoru, Madalina.
Computational Models of Argument: Proceedings of COMMA 2018. ed. / Sanjay Modgil; Katarzyna Budzynska; John Lawrence. IOS Press, 2018. p. 205-212 (Frontiers in Artificial Intelligence and Applications).

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

Yun, B, Vesic, S & Croitoru, M 2018, Toward a More Efficient Generation of Structured Argumentation Graphs. in S Modgil, K Budzynska & J Lawrence (eds), Computational Models of Argument: Proceedings of COMMA 2018. Frontiers in Artificial Intelligence and Applications, IOS Press, pp. 205-212, COMMA 2018, Warsaw, Poland, 12/09/18. https://doi.org/10.3233/978-1-61499-906-5-205

@inproceedings{2ae5f61d5e4d4b3bbabf30102cfda531,

title = "Toward a More Efficient Generation of Structured Argumentation Graphs",

abstract = "To address the needs of the EU NoAW project, in this paper we solve the problem of efficiently generating the argumentation graphs from knowledge bases expressed using existential rules. For the knowledge bases without rules, we provide a methodology that allows to optimise the generation of argumentation graphs. For knowledge bases with rules, we show how to filter out a large number of arguments and reduce the number of attacks.",

author = "Bruno Yun and Srdjan Vesic and Madalina Croitoru",

year = "2018",

doi = "10.3233/978-1-61499-906-5-205",

language = "English",

isbn = "978-1-61499-905-8",

series = "Frontiers in Artificial Intelligence and Applications",

publisher = "IOS Press",

pages = "205--212",

editor = "Sanjay Modgil and Budzynska, {Katarzyna } and John Lawrence",

booktitle = "Computational Models of Argument",

note = "COMMA 2018 ; Conference date: 12-09-2018 Through 14-09-2018",

}

TY - GEN

T1 - Toward a More Efficient Generation of Structured Argumentation Graphs

AU - Yun, Bruno

AU - Vesic, Srdjan

AU - Croitoru, Madalina

PY - 2018

Y1 - 2018

N2 - To address the needs of the EU NoAW project, in this paper we solve the problem of efficiently generating the argumentation graphs from knowledge bases expressed using existential rules. For the knowledge bases without rules, we provide a methodology that allows to optimise the generation of argumentation graphs. For knowledge bases with rules, we show how to filter out a large number of arguments and reduce the number of attacks.

AB - To address the needs of the EU NoAW project, in this paper we solve the problem of efficiently generating the argumentation graphs from knowledge bases expressed using existential rules. For the knowledge bases without rules, we provide a methodology that allows to optimise the generation of argumentation graphs. For knowledge bases with rules, we show how to filter out a large number of arguments and reduce the number of attacks.

U2 - 10.3233/978-1-61499-906-5-205

DO - 10.3233/978-1-61499-906-5-205

M3 - Published conference contribution

SN - 978-1-61499-905-8

T3 - Frontiers in Artificial Intelligence and Applications

SP - 205

EP - 212

BT - Computational Models of Argument

A2 - Modgil, Sanjay

A2 - Budzynska, Katarzyna

A2 - Lawrence, John

PB - IOS Press

T2 - COMMA 2018

Y2 - 12 September 2018 through 14 September 2018

ER -