Back to Search
Start Over
Toward a More Efficient Generation of Structured Argumentation Graphs
- Source :
- 7th International Conference on Computational Models of Argument (COMMA 2018), 7th International Conference on Computational Models of Argument (COMMA 2018), Sep 2018, Varsovie, Poland. pp.205-212, ⟨10.3233/978-1-61499-906-5-205⟩
- Publication Year :
- 2018
- Publisher :
- HAL CCSD, 2018.
-
Abstract
- International audience; 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.
- Subjects :
- [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- 7th International Conference on Computational Models of Argument (COMMA 2018), 7th International Conference on Computational Models of Argument (COMMA 2018), Sep 2018, Varsovie, Poland. pp.205-212, ⟨10.3233/978-1-61499-906-5-205⟩
- Accession number :
- edsair.dedup.wf.001..1d9574c257f2b6da492a22f034d047f5