Results 1 
4 of
4
On the measure of instability in normal residuated logic programs
 In Proceedings of FUZZIEEE’10
, 2010
"... Abstract. Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we focus on the measure of instability of normal residuated programs. Some measures are provided and initial results are obtained in te ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we focus on the measure of instability of normal residuated programs. Some measures are provided and initial results are obtained in terms of the amount of information that have to be discarded in order to recover stability. 1
Solving Weighted Argumentation Frameworks with Soft Constraints
"... Abstract. We suggest soft constraints as a mean to parametrically represent and solve “weighted ” Argumentation problems: different kinds of preference levels related to arguments, e.g. a score representing a “fuzziness”, a “cost ” or a probability level of each argument, can be represented by choos ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We suggest soft constraints as a mean to parametrically represent and solve “weighted ” Argumentation problems: different kinds of preference levels related to arguments, e.g. a score representing a “fuzziness”, a “cost ” or a probability level of each argument, can be represented by choosing different semiring algebraic structures. The novel idea is to provide a common computational and quantitative framework where the computation of the classical Dung’s extensions, e.g. the admissible extension, has an associated score representing “how much good ” the set is. Preference values associated to arguments are clearly more informative and can be used to prefer a given set of arguments over others with the same characteristics (e.g. admissibility). Moreover, we propose a mapping from weighted Argumentation Frameworks to Soft Constraint Satisfaction Problems (SCSPs); with this mapping we can compute Dung semantics (e.g. admissible and stable) by solving the related SCSP. To implement this mapping we use JaCoP, a Java constraint solver. 1
1On the Measure of Instability in Normal Residuated Logic Programs
"... Abstract—Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we focus on the measure of instability of normal residuated programs. Some measures were already provided and initial results obtained ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we focus on the measure of instability of normal residuated programs. Some measures were already provided and initial results obtained in terms of the amount of information that have to be discarded in order to recover stability; in this paper, our interest is focused precisely on the case in which stability can be recovered by adding information to our program. I.
ConArg: a Tool to Solve (Weighted) Abstract Argumentation Frameworks with (Soft) Constraints
"... ConArg is a Constraint Programmingbased tool that can be used to model and solve different problems related to Abstract Argumentation Frameworks (AFs). To implement this tool we have used JaCoP, a Java library that provides the user with a Finite Domain Constraint Programming paradigm. ConArg is ab ..."
Abstract
 Add to MetaCart
(Show Context)
ConArg is a Constraint Programmingbased tool that can be used to model and solve different problems related to Abstract Argumentation Frameworks (AFs). To implement this tool we have used JaCoP, a Java library that provides the user with a Finite Domain Constraint Programming paradigm. ConArg is able to randomly generate networks with smallworld properties in order to find conflictfree, admissible, complete, stable grounded, preferred, semistable, stage and ideal extensions on such interaction graphs. We present the main features of ConArg and we report the performance in time, showing also a comparison with ASPARTIX [1], a similar tool using Answer Set Programming. The use of techniques for constraint solving can tackle the complexity of the problems presented in [2]. Moreover we suggest semiringbased soft constraints as a mean to parametrically represent and solve Weighted Argumentation Frameworks: different kinds of preference levels related to attacks, e.g., a score representing a “fuzziness”, a “cost ” or a probability, can be represented by choosing different instantiation of the semiring algebraic structure. The basic idea is to provide a common computational and quantitative framework.