Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. The former stratifies the pieces of knowledge (expressed by logical formulas) accor?i�g to their level of certainty, while the latter exhibits relationships between variables. The two types of representations are semantically equivalent when they lead to the same possibility d...

Conditioning is an important task for designing intelligent systems in artificial intelligence. This paper addresses an issue related to the possibilistic counterparts of Jeffrey’s rule of conditioning. More precisely, it addresses the existence and unicity of solutions computed using the possibilistic counterparts of the socalled kinematics properties underlying Jeffrey’s rule of conditioning....

Possibilistic causal models have been proposed as an approach for prediction and diagnosis based on uncertain causal relations. However, the only way to develop the causal models is to acquire the possibilistic knowledge from the experts. The paper proposes an approach to develop the models from a dataset including causes and effects. It first develops a probabilistic causal model, then transfo...

We extend hybrid possibilistic conditioning to deal with inputs consisting of a set of triplets composed of propositional formulas, the level at which the formulas should be accepted, and the way in which their models should be revised. We characterize such conditioning using elementary operations on possibility distributions. We then solve a difficult issue that concerns the syntactic computat...

Possibilistic logic and quasi-classical logic are two logics that were developed in artificial intelligence for coping with inconsistency in different ways, yet preserving the main features of classical logic. This paper presents a new logic, called quasi-possibilistic logic, that encompasses possibilistic logic and quasi-classical logic, and preserves the merits of both logics. Indeed, it can ...

In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic where there exist some techniques to handle this inconsistency. In this work, we propose to manage inconsistent logic programs in a similar way as possibilistic logic does for classical logic. We compute a consistent subpr...

This work presents a novel interactive possibilistic linear programming (PLP) approach for solving the multiproduct aggregate production planning (APP) problem with imprecise forecast demand, related operating costs, and capacity. The proposed approach attempts to minimize total costs with reference to inventory levels, labor levels, overtime, subcontracting and backordering levels, and labor, ...

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

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be es­ timated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possi­ bility degree or a necessity degree that ex­ presses to what extent the formula is pos­ sibly or necessarily true. Possibilistic reso­ lution yields a calculus for pos...

Possibilistic networks are important and efficient tools for reasoning under uncertainty. This paper proposes a new graphical model for decision making under uncertainty based on possibilistic networks. In possibilistic decision problems under uncertainty, available knowledge is expressed by means of possibility distribution and preferences are encoded by means another possibility distribution ...