Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility distributions. This paper studies a new representation format, called hybrid possibilistic networks, which cover both standard possibilistic networks and possibilistic knowledge bases. An adaptation of propagation algor...

In this work, we define a new framework in order to improve the knowledge representation power of Answer Set Programming paradigm. Our proposal is to use notions from possibility theory to extend the stable model semantics by taking into account a certainty level, expressed in terms of necessity measure, on each rule of a normal logic program. First of all, we introduce possibilistic definite l...

Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...

Possibilistic decision theory is a natural one to consider when information about uncertainty cannot be quantified in probabilistic way. Different qualitative criteria based on possibility theory have been proposed, the definition of which requires a finite ordinal, non compensatory, scale for evaluating both utility and plausibility. In presence of heterogeneous information, i.e. when the know...

The objective of the paper is to deal with a kind of possibilistic linear programming (PLP) problem involving multiple objectives of conflicting nature. In particular, we have considered a multi objective linear programming (MOLP) problem whose objective is to simultaneously minimize cost and maximize profit in a supply chain where cost and profit coefficients, and related parameters such as av...

This Thesis raises the question of collective decision making under possibilistic uncertainty. We propose several collective qualitative decision rules and show that in the context of a possibilistic representation of uncertainty, the use of an egalitarian pessimistic collective utility function allows us to get rid of the Timing Effect. Making a step further, we prove that if both the agents’ ...

We revise classical results in Argumentation-based Logic Programming, e.g., Defeasible Logic Programming (DeLP), under the umbrella of Satisfiability Modulo CHR. Through this language it is possible to reason on arguments and have an underlying theory solver to implement resolution of conflicts. Strict and defeasible rules, as well as certainty scores associated with such rules (e.g., Possibili...

In this paper, we show how a possibilistic uncertainty model can be used to represent and manipulate uncertainty about the states of a system and of its components. At the same time, we present a thorough study of the incorporation of this possibilistic uncertainty model in classical, two-state reliability theory. The possibilistic reliability of a component or system is introduced and studied....

We provide basic results for the development of a theory of possibilistic Markov processes. We define and study possibilistic Markov processes and possibilistic Markov chains, and derive a possibilistic analogon of the Chapman-Kolmogorov equation. We also show how possibilistic Markov processes can be constructed using one-step transition possibilities.