- Full text PDF available (53)
- This year (7)
- Last 5 years (56)
- Last 10 years (61)
Journals and Conferences
Article history: Available online 24 May 2010
In the traditional definition of Dung’s abstract argumentation 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 argumentation framework called AFRA (Argumentation Framework with Recursive Attacks),… (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)
The University Repository is a digital collection of the research output of the University, available on Open Access. Copyright and Moral Rights for the items on this site are retained by the individual author and/or other copyright owners. Users may access full items free of charge; copies of full text items generally can be reproduced, displayed or… (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.
This paper introduces Input/Output Argumentation Frameworks, a novel approach to characterize the behavior of an argumentation framework as a sort of black box exposing a well-defined external interface. As a starting point, we define the novel notion of semantics decomposability and analyze complete, stable, grounded and preferred semantics in this… (More)
This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can… (More)
This paper describes a preliminary proposal of an argumentation-based approach to modeling articulated decision support contexts. The proposed approach encompasses a variety of argument and attack schemes aimed at representing basic knowledge and reasoning patterns for decision support. Some of the defined attack schemes involve attacks directed towards… (More)
In this paper we describe the AFBenchGen system, which allows to automatically generate randomised argumentation frameworks for testing purposes.
Argumentation Frameworks (AFs) provide a fruitful basis for exploring issues of defeasible reasoning. Their power largely derives from the abstract nature of the arguments within the framework, where arguments are atomic nodes in an undifferentiated relation of attack. This abstraction conceals different senses of argument, namely a single-step reason to a… (More)