Qualitative possibilistic networks, also known as min-based possibilistic networks, are important tools for handling uncertain information in the possibility theory framework. Despite their importance, only the junction tree adaptation has been proposed for exact reasoning with such networks. This paper explores alternative algorithms using compilation techniques. We first propose possibilistic...

In the paper we consider the problem of the statistical evaluation and comparison of different classification algorithms. For this purpose we apply the methodology of statistical tests for testing independence in the case the multinomial distribution. We propose to use two-sample tests for the comparison of different classification algorithms. In the paper we consider only the case of the super...

Possibilistic networks are useful tools for reasoning under uncertainty. Uncertain pieces of information can be described by different measures: possibility measures, necessity measures and more recently, guaranteed possibility measures, denoted by Δ. This paper first proposes the use of guaranteed possibility measures to define a so-called Δ-based possibilistic network. This graphical represen...

Naive Bayesian Classifiers, which rely on independence hypotheses, together with a normality assumption to estimate densities for numerical data, are known for their simplicity and their effectiveness. However, estimating densities, even under the normality assumption, may be problematic in case of poor data. In such a situation, possibility distributions may provide a more faithful representat...

This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic knowledge bases, provided by different sources, into a new possibilistic knowledge base. These combination rules are first described at the meta-level outside the language of possibilistic logic. Next, an extension of p...

Manipulation of perceptions is a remarkable human capability in a wide variety of physical and mental tasks under fuzzy or uncertain surroundings. Possibilistic reasoning can be treated as a mechanism that mimics human inference mechanisms with uncertain information. Petri nets are a graphical and mathematical modeling tool with powerful modeling and analytical ability. The focus of this paper ...

In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...

As one attack on the “knowledge acquisition bottleneck”, we are attempting to exploit a largely untapped source of general knowledge in texts, lying at a level beneath the explicit assertional content. This knowledge consists of relationships implied to be possible in the world, or, under certain conditions, implied to be normal or commonplace in the world. The goal of the work reported is to d...

This paper deals with learning implication relations from some kinds of knowledge (statistical studies, possibilistic information or possible worlds) about truth valuations on a set of propositions. An induction principle is considered in each one of this cases. If only the possible valuations are known, then it is checked when two families of possible valuations produce the same implication. A...

Possibilitic networks, which are compact representations of possibility distributions, are powerful tools for representing and reasoning with uncertain and incomplete knowledge. According to the operator conditioning is based on, there are two possibilistic settings: quantitative and qualitative. This paper deals with qualitative possibilistic network classifiers under uncertain inputs. More pr...