Toward a More Efficient Generation of Structured Argumentation Graphs

Bruno Yun, Srdjan Vesic, Madalina Croitoru

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)
2 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 languageEnglish
Title of host publicationComputational Models of Argument
Subtitle of host publicationProceedings of COMMA 2018
EditorsSanjay Modgil, Katarzyna Budzynska, John Lawrence
PublisherIOS Press
Pages205-212
Number of pages8
ISBN (Electronic)978-1-61499-906-5
ISBN (Print)978-1-61499-905-8
DOIs
Publication statusPublished - 2018
EventCOMMA 2018 - Warsaw, Poland
Duration: 12 Sep 201814 Sep 2018

Publication series

NameFrontiers in Artificial Intelligence and Applications

Conference

ConferenceCOMMA 2018
CountryPoland
CityWarsaw
Period12/09/1814/09/18

Cite this

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 (pp. 205-212). (Frontiers in Artificial Intelligence and Applications). IOS Press. https://doi.org/10.3233/978-1-61499-906-5-205