Recently, a good set of logic programming semantics has been defined for capturing possibilistic logic program. Practically all of them follow a credulous reasoning approach. This means that given a possibilistic logic program one can infer a set of possibilistic models. However, sometimes it is desirable to associate just one possibilistic model to a given possibilistic logic program. One of t...

Linear equality systems with fuzzy parameters and crisp variables defined by the extension principle are called possibilistic linear equality systems. The study focuses on the problem of stability (with respect to perturbations of fuzzy parameters) of the solution in these systems.

Linear equality systems with fuzzy parameters and crisp variables defined by the Zadeh’s extension principle are called possibilistic linear equality systems. This study focuses on the problem of stability (with respect to small changes in the membership function of fuzzy parameters) of the solution in these systems.

We show that possibilistic quadratic programs with crisp decision variables and continuous fuzzy number coefficients are well-posed, i.e. small changes in the membership function of the coefficients may cause only a small deviation in the possibility distribution of the objective function.

14 Intuitionistic Group Decision Making to Identify the Status of Student’s Knowledge Acquisition in E-Learning Systems; Mukta Goyal, Department of Computer Science, Jaypee Institute of Information Technology, Noida, India Alka Tripathi, Department of Mathematics, Jaypee Institute of Information Technology, Noida, India Divakar Yadav, Department of Computer Science, Jaypee Institute of Informat...

This paper is an attempt to cast both uncertainty and time in a logical framework. It generalizes possibilistic logic, previously developed by the authors, where each classical formula is associated with a weight which obeys the laws of possibility theory. In the possibilistic temporal logic we present here, each formula is associated with a time set (a fuzzy set in the more general case) which...

In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly there are also two kinds of possibilistic logic: standard (min-based) possibilistic logic and quantitative (product-based) possibilistic logic. Recently, several equivalent transformations between standard possibilistic...

General automata are considered with respect to normal-ization over semirings. Possibilistic automata are deened as normal pessimistic fuzzy automata. Possibilistic automata are analogous to stochas-tic automata where stochastic (+=) semirings are replaced by possi-bilistic (_=^) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata)...

The graded possibilistic clustering paradigm includes as the two extreme cases the “probabilistic” assumption and the “possibilistic” assumption adopted by many clustering algorithms. We propose an implementation of a graded possibilistic clustering algorithm based on an interval equality constraint enforcing both the normality condition and the required graded possibilistic condition. Experime...