In the traditional definition of Dung's abstract argumenta-tion framework (AF), the notion of attack is understood as a relation between arguments, thus bounding attacks to start from and be directed to arguments. This paper introduces a generalized definition of abstract ar-gumentation framework called AF RA (Argumentation Framework with Recursive… (More)
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive… (More)
In this paper we describe the system ArgSemSAT which includes algorithms which we proved to overcome current state-of-the-art performances in enumerating preferred extensions.
a r t i c l e i n f o a b s t r a c t This paper tackles the fundamental questions arising when looking at argumentation frameworks as interacting components, characterized by an Input/Output behavior, rather than as isolated monolithical entities. This modeling stance arises naturally in some application contexts, like multi-agent systems, but, more… (More)
Users may access full items free of charge; copies of full text items generally can be reproduced, displayed or performed and given to third parties in any format or medium for personal research or study, educational or not-for-profit purposes without prior permission or charge, provided: • The authors, title and full bibliographic details is credited in… (More)
Semantics extensions are the outcome of the argumenta-tion reasoning process: enumerating them is generally an intractable problem. For preferred semantics two efficient algorithms have been recently proposed, PrefSAT and SCC-P, with significant runtime variations. This preliminary work aims at investigating the reasons (argumentation framework features)… (More)