A tool for merging extensions of abstract argumentation frameworks

Argument and Computation 13 (3):361-368 (2022)
  Copy   BIBTEX

Abstract

We describe a tool that allows the merging of extensions of argumentation frameworks, following the approach defined by 33–42). The tool is implemented in Java, and is highly modular thanks to Object Oriented Programming principles. We describe a short experimental study that assesses the scalability of the approach, as well as the impact on runtime of using an integrity constraint.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A labelling approach for ideal and stage semantics.Martin Caminada - 2011 - Argument and Computation 2 (1):1 - 21.
Equational approach to argumentation networks.D. M. Gabbay - 2012 - Argument and Computation 3 (2-3):87 - 142.
Logic Based Merging.Sébastien Konieczny & Ramón Pino Pérez - 2011 - Journal of Philosophical Logic 40 (2):239-270.
Sequent-based logical argumentation.Ofer Arieli & Christian Straßer - 2015 - Argument and Computation 6 (1):73-99.

Analytics

Added to PP
2022-10-21

Downloads
8 (#1,345,183)

6 months
6 (#587,658)

Historical graph of downloads
How can I increase my downloads?