Multi-objective De Novo linear programming (MODNLP) is problem for designing optimal system by reshaping the feasible set (Fiala [3] ). This paper deals with MODNLP having possibilistic objective functions coefficients. The problem is considered by inserting possibilistic data in the objective functions coefficients. The solution of the problem is defined and established under the using of effi...

Approximate reasoning with words is one of the remarkable human capability that manipulates perceptions in a wide variety of physical and mental tasks whether in fuzzy or uncertain surroundings. To model this remarkable human capability, L.A. Zadeh (1999) proposed a new concept of "computing with words", which is a methodology in which the objects of computation are words and propositions drawn...

This paper first proposes a new graphical model for decision making under uncertainty based on min-based possibilistic networks. A decision problem under uncertainty is described by means of two distinct min-based possibilistic Computing Optimistic Decisions 1039 networks: the first one expresses agent’s knowledge while the second one encodes agent’s preferences representing a qualitative utili...

In this paper, a new method for merging multiple inconsistent knowledge bases in the framework of possibilistic logic is presented. We divide the fusion process into two steps: one is called the splitting step and the other is called the combination step. Given several inconsistent possibilistic knowledge bases (i.e. the union of these possibilistic bases is inconsistent), we split each of them...

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One ...

In this paper, a new Hopfield-model net based on fuzzy possibilistic reasoning is proposed for the classification of multispectral images. The main purpose is to modify the Hopfield network embedded with fuzzy possibilistic -means (FPCM) method to construct a classification system named fuzzy-possibilistic Hopfield net (FPHN). The classification system is a paradigm for the implementation of fu...

Naive Bayes classiiers can be seen as special probabilistic networks with a star-like structure. They can easily be induced from a dataset of sample cases. However, as most probabilistic approaches, they run into problems, if imprecise (i.e, set-valued) information in the data to learn from has to be taken into account. An approach to handle uncertain as well imprecise information, which recent...

Naive Bayes classifiers can be seen as special probabilistic networks with a star-like structure. They can easily be induced from a dataset of sample cases. However, as most probabilistic approaches, they run into problems, if imprecise (i.e, set-valued) information in the data to learn from has to be taken into account. An approach to handle uncertain as well imprecise information, which recen...

Possibilistic networks offer a qualitative approach for modeling epistemic uncertainty. Their practical implementation requires the specification of conditional possibility tables, as in the case of Bayesian networks for probabilities. The elicitation of probability tables by experts is made much easier by means of noisy logical gates that enable multidimensional tables to be constructed from t...

This paper treats risk based on the notions of credibility measure and credibility expected value. Firstly, the paper derives and discusses the credibility expected value. Secondly, the paper presents a new method of analysis of possibilistic portfolios. The new step is a construction by which with a possibilistic portfolio one associates a probabilistic portfolio. The problem solving of possib...