Results 1  10
of
29
Possibility Theory as a Basis for Qualitative Decision Theory
, 1995
"... A counterpart to von Neumann and Morgenstern' expected utility theory is proposed in the framework of possibility theory. The existence of a utility function, representing a preference ordering among possibility distributions (on the consequences of decisionmaker's actions) that satisfies a series ..."
Abstract

Cited by 99 (25 self)
 Add to MetaCart
A counterpart to von Neumann and Morgenstern' expected utility theory is proposed in the framework of possibility theory. The existence of a utility function, representing a preference ordering among possibility distributions (on the consequences of decisionmaker's actions) that satisfies a series of axioms pertaining to decisionmaker's behavior, is established. The obtained utility is a generalization of Wald's criterion, which is recovered in case of total ignorance; when ignorance is only partial, the utility takes into account the fact that some situations are more plausible than others. Mathematically, the qualitative utility is nothing but the necessity measure of a fuzzy event in the sense of possibility theory (a socalled Sugeno integral). The possibilistic representation of uncertainty, which only requires a linearly ordered scale, is qualitative in nature. Only max, min and orderreversing operations are used on the scale. The axioms express a riskaverse behavior of the d...
Semiringbased CSPs and Valued CSPs: Frameworks, Properties, and Comparison
 Constraints
, 1999
"... In this paper we describe and compare two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. While comparing the two ..."
Abstract

Cited by 99 (27 self)
 Add to MetaCart
In this paper we describe and compare two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. While comparing the two approaches, we show how to pass from one to the other one, and we discuss when this is possible. The two frameworks have been independently introduced in [2], [3] and [35].
Constraint Solving over Semirings
 in IJCAI
, 1995
"... We introduce a general framework for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated to each tuple o ..."
Abstract

Cited by 98 (36 self)
 Add to MetaCart
We introduce a general framework for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated to each tuple of values of the variable domain, and the two semiring operations (+ and x) model constraint projection and combination respectively. Local consistency algorithms, as usually used for classical CSPs, can be exploited in this general framework as well, provided that some conditions on the semiring operations are satisfied. We then show how this framework can be used to model both old and new constraint solving schemes, thus allowing one both to formally justify many informally taken choices in existing schemes, and to prove that the local consistency techniques can be used also in newly defined schemes. 1
Fuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems
 ACM Transactions on Database Systems
, 1988
"... This paper deals with the application of fuzzy logic in a relational database environment with the objective of capturing more meaning of the data. It is shown that with suitable interpretations for the fuzzy membership functions, a fuzzy relational data model can be used to represent ambiguities in ..."
Abstract

Cited by 73 (0 self)
 Add to MetaCart
This paper deals with the application of fuzzy logic in a relational database environment with the objective of capturing more meaning of the data. It is shown that with suitable interpretations for the fuzzy membership functions, a fuzzy relational data model can be used to represent ambiguities in data values as well as impreciseness in the association among them. Relational operators for fuzzy relations have been studied, and applicability of fuzzy logic in capturing integrity constraints has been investigated. By introducing a fuzzy resemblance measure EQUAL for comparing domain values, the definition of classical functional dependency has been generalized to fuzzy functional dependency (ffd). The implication problem of ffds has been examined and a set of sound and complete inference axioms has been proposed. Next, the problem of lossless join decomposition of fuzzy relations for a given set of fuzzy functional dependencies is investigated. It is proved that with a suitable restriction on EQUAL, the design theory of a classical relational database with functional dependencies can be extended to fuzzy relations satisfying fuzzy functional dependencies.
Mining WordNet for Fuzzy Sentiment: Sentiment Tag Extraction from WordNet Glosses
, 2006
"... Many of the tasks required for semantic tagging of phrases and texts rely on a list of words annotated with some semantic features. We present a method for extracting sentimentbearing adjectives from WordNet using the Sentiment Tag Extraction Program (STEP). We did 58 STEP runs on unique non ..."
Abstract

Cited by 46 (2 self)
 Add to MetaCart
Many of the tasks required for semantic tagging of phrases and texts rely on a list of words annotated with some semantic features. We present a method for extracting sentimentbearing adjectives from WordNet using the Sentiment Tag Extraction Program (STEP). We did 58 STEP runs on unique nonintersecting seed lists drawn from manually annotated list of positive and negative adjectives and evaluated the results against other manually annotated lists. The 58 runs were then collapsed into a single set of 7, 813 unique words. For each word we computed a Net Overlap Score by subtracting the total number of runs assigning this word a negative sentiment from the total of the runs that consider it positive. We demonstrate that Net Overlap Score can be used as a measure of the words degree of membership in the fuzzy category of sentiment: the core adjectives, which had the highest Net Overlap scores, were identified most accurately both by STEP and by human annotators, while the words on the periphery of the category had the lowest scores and were associated with low rates of interannotator agreement.
Semiringbased CSPs and Valued CSPs: Basic Properties and Comparison
, 1996
"... . We introduce two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. We then compare the two approaches and we discu ..."
Abstract

Cited by 41 (9 self)
 Add to MetaCart
. We introduce two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. We then compare the two approaches and we discuss the relationship between them. 1 Introduction Classical constraint satisfaction problems (CSPs) [19, 17] are a very expressive and natural formalism to specify many kinds of reallife problems. In fact, problems ranging from map coloring, vision, robotics, jobshop scheduling, VLSI design, etc., can easily be cast as CSPs and solved using one of the many techniques that have been developed for such problems or subclasses of them [8, 9, 18, 16, 19]. However, they also have evident limitations, mainly due to the fact that they are not very flexible when trying to represent reallife scenarios where the knowledge is not completely available nor crisp. In fact, in such situations, the abilit...
Compiling Semiringbased Constraints with ...
 In M.Maher and JF. Puget, editors, Proc. CP98. SpringerVerlag, LNCS 1520
, 1998
"... . In some recent works, a general framework for finite domains constraint satisfaction has been defined, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions, to compute arcconsis ..."
Abstract

Cited by 37 (8 self)
 Add to MetaCart
. In some recent works, a general framework for finite domains constraint satisfaction has been defined, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions, to compute arcconsistency. Restricting to that case and integrating semiringbased constraint solving in the Constraint Logic Programming paradigm, we have implemented a generic language, clp(FD,S), for semiringbased constraint satisfaction. In this paper, we describe the kernel of the language: the SFD system and our implementation of clp(FD,S). We also give some performance results on various examples. 1 Introduction In [1, 2], a general framework for finite domains constraint satisfaction and optimization has been defined, where classical CSPs [15, 13, 14], fuzzy CSPs [16, 9, 17], partial CSPs [10] and others can be easily cast. This framework is based on a semiring structure. Moreover, the authors show t...
A BEHAVIORAL FOUNDATION FOR FUZZY MEASURES
, 1990
"... In Savage [41] a 'behavioral foundation' was given for subjective probabilities, to be used in the maximization of expected utility. This paper analogously gives a behavioral foundation for fuzzy measures, to be used in the maximization of 'Choquetexpected utility'. This opens the way to empirical ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
In Savage [41] a 'behavioral foundation' was given for subjective probabilities, to be used in the maximization of expected utility. This paper analogously gives a behavioral foundation for fuzzy measures, to be used in the maximization of 'Choquetexpected utility'. This opens the way to empirical verification or falsification of fuzzy measures, and frees them of their 'ad hoc' character.
Acquiring domain knowledge for negotiating agents: A case of study
 INTERNATIONAL JOURNAL OF HUMAN COMPUTER STUDIES
, 2004
"... In this paper, we employ the fuzzy repertory table technique to acquire the necessary domain knowledge for software a ents to act as sellers and buyers usin a bilateral, multial,g ne otiation model that can achieve optimal results in semicompetitive environments. ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
In this paper, we employ the fuzzy repertory table technique to acquire the necessary domain knowledge for software a ents to act as sellers and buyers usin a bilateral, multial,g ne otiation model that can achieve optimal results in semicompetitive environments.