An Efficient Java-Based Solver for Abstract Argumentation Frameworks: jArgSemSAT

Federico Cerutti, Mauro Vallati, Massimiliano Giacomin

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Dung’s argumentation frameworks are adopted in a variety of applications, from argument-mining, to intelligence analysis and legal reasoning. Despite this broad spectrum of already existing applications, the mostly adopted solver—in virtue of its simplicity—is far from being comparable to the current state-of-the-art solvers. On the other hand, most of the current state-of-the-art solvers are far too complicated to be deployed in real-world settings. In this paper we provide and extensive description of jArgSemSAT, a Java re-implementation of ArgSemSAT. ArgSemSAT represents the best single solver for argumentation semantics with the highest level of computational complexity. We show that jArgSemSAT can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. Our large experimental analysis shows that despite being written in Java, jArgSemSAT would have scored in most of the cases among the three bests solvers for the two semantics with highest computational complexity “Stable and Preferred” in the last competition on computational models of argumentation.
LanguageEnglish
Article number1750002
Number of pages26
JournalInternational Journal on Artificial Intelligence Tools
Volume26
Issue number02
DOIs
Publication statusPublished - 12 Apr 2017

Fingerprint

Computational complexity
Semantics
Web services

Cite this

@article{2d22fda9d3774a80916bb340b6f79292,
title = "An Efficient Java-Based Solver for Abstract Argumentation Frameworks: jArgSemSAT",
abstract = "Dung’s argumentation frameworks are adopted in a variety of applications, from argument-mining, to intelligence analysis and legal reasoning. Despite this broad spectrum of already existing applications, the mostly adopted solver—in virtue of its simplicity—is far from being comparable to the current state-of-the-art solvers. On the other hand, most of the current state-of-the-art solvers are far too complicated to be deployed in real-world settings. In this paper we provide and extensive description of jArgSemSAT, a Java re-implementation of ArgSemSAT. ArgSemSAT represents the best single solver for argumentation semantics with the highest level of computational complexity. We show that jArgSemSAT can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. Our large experimental analysis shows that despite being written in Java, jArgSemSAT would have scored in most of the cases among the three bests solvers for the two semantics with highest computational complexity “Stable and Preferred” in the last competition on computational models of argumentation.",
keywords = "abstract argumentation, argumentation semantics, off-the-shelf solver",
author = "Federico Cerutti and Mauro Vallati and Massimiliano Giacomin",
year = "2017",
month = "4",
day = "12",
doi = "10.1142/S0218213017500026",
language = "English",
volume = "26",
journal = "International Journal on Artificial Intelligence Tools",
issn = "0218-2130",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "02",

}

An Efficient Java-Based Solver for Abstract Argumentation Frameworks : jArgSemSAT. / Cerutti, Federico; Vallati, Mauro; Giacomin, Massimiliano.

In: International Journal on Artificial Intelligence Tools, Vol. 26, No. 02, 1750002, 12.04.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An Efficient Java-Based Solver for Abstract Argumentation Frameworks

T2 - International Journal on Artificial Intelligence Tools

AU - Cerutti, Federico

AU - Vallati, Mauro

AU - Giacomin, Massimiliano

PY - 2017/4/12

Y1 - 2017/4/12

N2 - Dung’s argumentation frameworks are adopted in a variety of applications, from argument-mining, to intelligence analysis and legal reasoning. Despite this broad spectrum of already existing applications, the mostly adopted solver—in virtue of its simplicity—is far from being comparable to the current state-of-the-art solvers. On the other hand, most of the current state-of-the-art solvers are far too complicated to be deployed in real-world settings. In this paper we provide and extensive description of jArgSemSAT, a Java re-implementation of ArgSemSAT. ArgSemSAT represents the best single solver for argumentation semantics with the highest level of computational complexity. We show that jArgSemSAT can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. Our large experimental analysis shows that despite being written in Java, jArgSemSAT would have scored in most of the cases among the three bests solvers for the two semantics with highest computational complexity “Stable and Preferred” in the last competition on computational models of argumentation.

AB - Dung’s argumentation frameworks are adopted in a variety of applications, from argument-mining, to intelligence analysis and legal reasoning. Despite this broad spectrum of already existing applications, the mostly adopted solver—in virtue of its simplicity—is far from being comparable to the current state-of-the-art solvers. On the other hand, most of the current state-of-the-art solvers are far too complicated to be deployed in real-world settings. In this paper we provide and extensive description of jArgSemSAT, a Java re-implementation of ArgSemSAT. ArgSemSAT represents the best single solver for argumentation semantics with the highest level of computational complexity. We show that jArgSemSAT can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. Our large experimental analysis shows that despite being written in Java, jArgSemSAT would have scored in most of the cases among the three bests solvers for the two semantics with highest computational complexity “Stable and Preferred” in the last competition on computational models of argumentation.

KW - abstract argumentation

KW - argumentation semantics

KW - off-the-shelf solver

U2 - 10.1142/S0218213017500026

DO - 10.1142/S0218213017500026

M3 - Article

VL - 26

JO - International Journal on Artificial Intelligence Tools

JF - International Journal on Artificial Intelligence Tools

SN - 0218-2130

IS - 02

M1 - 1750002

ER -