Possibilistic logic is a well-known logic for reasoning under uncertainty, which is based on the idea that the epistemic state of an agent can be modeled by assigning to each possible world a degree of possibility, taken from a totally ordered, but essentially qualitative scale. Recently, a generalization has been proposed that extends possibilistic logic to a meta-epistemic logic, endowing it ...

— In this paper we study the optimal saving problem in the framework of possibility theory. The notion of possibilistic precautionary saving is introduced as a measure of the way the presence of possibilistic risk (represented by a fuzzy number) influences a consumer in establishing the level of optimal saving. The notion of prudence of an agent in the face of possibilistic risk is defined and ...

In this paper we propose a new formalization of the inductive logic programming (ILP) problem for a better handling of exceptions. It is now encoded in first-order possibilistic logic. This allows us to handle exceptions by means of prioritized rules, thus taking lessons from non-monotonic reasoning. Indeed, in classical first-order logic, the exceptions of the rules that constitute a hypothesi...

The design of closed-loop supply chain networks has attracted more attention in recent years according to business and environmental factors. The significance of accounting for uncertainty and risk in such networks spurs an interest to develop appropriate decision making tools to cope with uncertain and imprecise parameters in closed-loop supply chain network design problems. This paper propose...

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

Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be establish...

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

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