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...

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....

Possibilistic causal models have been proposed as an approach for prediction and diagnosis based on uncertain causal relations. However, the only way to develop the causal models is to acquire the possibilistic knowledge from the experts. The paper proposes an approach to develop the models from a dataset including causes and effects. It first develops a probabilistic causal model, then transfo...

We extend hybrid possibilistic conditioning to deal with inputs consisting of a set of triplets composed of propositional formulas, the level at which the formulas should be accepted, and the way in which their models should be revised. We characterize such conditioning using elementary operations on possibility distributions. We then solve a difficult issue that concerns the syntactic computat...

Possibilistic logic and quasi-classical logic are two logics that were developed in artificial intelligence for coping with inconsistency in different ways, yet preserving the main features of classical logic. This paper presents a new logic, called quasi-possibilistic logic, that encompasses possibilistic logic and quasi-classical logic, and preserves the merits of both logics. Indeed, it can ...