In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.

Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics (DLs) as an extension of description logics. We give semantics and syntax of possibilistic description logics. Two kinds of inference services are considered in our logics and algorithms are provided for them. These algorithms are imp...

Abstract: This paper deals with a portfolio selection problem with fuzzy return rates. A possibilistic mean VaR model was proposed for portfolio selection. Specially, we present a mathematical programming model with possibilistic constraint. The possibilistic programming problem can be solved by transforming it into a linear programming problem. A numerical example is given to illustrate the be...

The aim of this paper is to propose a generalization of previous approaches in qualitative decision making. Our work is based on the binary possibilistic utility (PU), which is a possibilistic counterpart of Expected Utility (EU). We first provide a new axiomatization of PU and study its relation with the lexicographic aggregation of pessimistic and optimistic utilities. Then we explain the rea...

A generalized approach to possibilistic clustering algorithms was proposed in [19], where the memberships are evaluated directly according to the data information using the fuzzy set theory, and the cluster centers are updated via a performance index. The computational experiments based on the generalized possibilistic clustering algorithms in [19] revealed that these clustering algorithms coul...

Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the curre...

Possibility theory is applied to introduce and reason about the fundamental notion of a key for uncertain data. Uncertainty is modeled qualitatively by assigning to tuples of data a degree of possibility with which they occur in a relation, and assigning to keys a degree of certainty which says to which tuples the key applies. The associated implication problem is characterized axiomatically an...

Compared with the conventional probabilistic mean-variance methodology, fuzzy number can better describe an uncertain environment with vagueness and ambiguity. Based on this fact, possibilistic mean-variance utilities to portfolio selection for bounded assets are discussed in this paper. The possibilistic mean value of the expected return is termed measure of investment return and the possibili...

Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. The former stratifies the pieces of knowledge (expressed by logical formulas) accor?i�g to their level of certainty, while the latter exhibits relationships between variables. The two types of representations are semantically equivalent when they lead to the same possibility d...

Conditioning is an important task for designing intelligent systems in artificial intelligence. This paper addresses an issue related to the possibilistic counterparts of Jeffrey’s rule of conditioning. More precisely, it addresses the existence and unicity of solutions computed using the possibilistic counterparts of the socalled kinematics properties underlying Jeffrey’s rule of conditioning....