Based on our earlier work on partial logics and extended logic programs Wag91, Wag94, HJW96], and on the possibilistic logic of DLP94], we deene a compositional possibilistic rst-order logic with two kinds of negation as the logical basis of semi-possibilistic and possibilis-tic logic programs. We show that in the same way as the minimal model semantics of relational databases can be reened to ...

This paper deals with the querying of possibilistic relational databases, by means of possibilistic queries whose general form is: "to what extent is it possible that the answer to Q satisfies property P". Here, we consider cardinality-based queries (in this case, property P is about cardinality) for which a processing technique is proposed, which avoids computing all the worlds attached to the...

This article is a first step in the direction of extending possibilistic planning to account for incomplete and imprecise knowledge of the world state. Fundamental definitions are given and the possibilistic planning problem is recast in this new setting. Finally, it is shown that, under certain conditions, possibilistic planning with imprecise and incomplete state descriptions is no harder tha...

The robustness of a network is the ability to maintain a satisfactory performance level when there may be system endogenous random failures plus possible failures caused by external attacks. A new approach for determining network robustness is presented based on the difference between the possibilistic and probabilistic network dependability estimates. Both the probabilistic and possibilistic e...

Most of the real life classification problems have ill defined, imprecise or fuzzy class boundaries. Feedforward neural networks with conventional backpropagation learning algorithm are not tailored to this kind of classification problem. Hence, in this paper, feedforward neural networks, that use backpropagation learning algorithm with fuzzy objective functions, are investigated. A learning al...

Within the possibilistic approach to uncer­ tainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We re­ late this qualitative modal logic to the many­ valued analogues MVS5 and MVKD45 of the well known modal logics of knowledge and be­ lief 55 and KD45 respectively. Completeness ...

In this paper we revisit a 1994 paper by Hájek et al. where a modal logic over a finitely-valued Łukasiewicz logic is defined to capture possibilistic reasoning. In this paper we go further in two aspects: first, we generalize the approach in the sense of considering modal logics over an arbitrary finite MTL-chain, and second, we consider a different possibilistic semantics for the necessity an...

We present an overview on how to perform non-monotonic reasoning based on paraconsistent logics. In particular, we show that one can define a logic programming semantics based on the paraconsistent logic G’3 which is called G’3-stable semantics. This semantics defines a frame for performing non-monotonic reasoning in domains which are pervaded with vagueness and inconsistencies. In fact, we sho...

Upper and lower regression models (dual possibilistic models) are proposed for data analysis with crisp inputs and interval or fuzzy outputs. Based on the given data, the dual possibilistic models can be derived from upper and lower directions, respectively, where the inclusion relationship between these two models holds. Thus, the inherent uncertainty existing in the given phenomenon can be ap...