Argumentation Extensions Enumeration as a Constraint Satisfaction Problem: A Performance Overview

Mauro Vallati, Federico Cerutti, Massimiliano Giacomin

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For preferred semantics four implementations have been recently proposed, CONArg2, AspartixM, PrefSAT and NAD-Alg, with significant runtime variations. This work is a first empirical evaluation of the performance of these implementations with the hypothesis that NAD-Alg, as representative of a family of ad-hoc approaches, will overcome in sequence PrefSAT-a SAT-based approach-, CONArg2-a CSP-based approach-, and the ASP-based approach AspartixM. The results shows that this is not always the case, as PrefSAT has been often the best approach both in terms of numbers of enumeration problems solved, and CPU-time. Moreover, we identify situations where AspartixM has been proved to be significantly faster than CONArg2.

Original languageEnglish
Number of pages13
JournalCEUR Workshop Proceedings
Volume1212
Publication statusPublished - 18 Aug 2014
EventInternational Workshop on Defeasible and Ampliative Reasoning - Prague, Czech Republic
Duration: 19 Aug 201419 Aug 2014
http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=36617&copyownerid=19937 (Link to Workshop Information)

    Fingerprint

Cite this