Graphical and Logical-Based Representations of Uncertain Information in a Possibility Theory Framework

Author(s):  
Salem Benferhat
Author(s):  
NAHLA BEN AMOR ◽  
SALEM BENFERHAT

Independence relations play an important role in uncertain reasoning based on Bayesian networks. In particular, they are useful in decomposing joint distributions into more elementary local ones. Recently, in a possibility theory framework, several qualitative independence relations have been proposed, where uncertainty is encoded by means of a complete pre-order between states of the world. This paper studies the well-known graphoid properties of these qualitative independences. Contrary to the probabilistic independence, several qualitative independence relations are not necessarily symmetric. Therefore, we also analyze the symmetric counterparts of graphoid properties (called reverse graphoid properties).


Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 487 ◽  
Author(s):  
Miao Qin ◽  
Yongchuan Tang ◽  
Junhao Wen

Dempster–Shafer evidence theory (DS theory) has some superiorities in uncertain information processing for a large variety of applications. However, the problem of how to quantify the uncertainty of basic probability assignment (BPA) in DS theory framework remain unresolved. The goal of this paper is to define a new belief entropy for measuring uncertainty of BPA with desirable properties. The new entropy can be helpful for uncertainty management in practical applications such as decision making. The proposed uncertainty measure has two components. The first component is an improved version of Dubois–Prade entropy, which aims to capture the non-specificity portion of uncertainty with a consideration of the element number in frame of discernment (FOD). The second component is adopted from Nguyen entropy, which captures conflict in BPA. We prove that the proposed entropy satisfies some desired properties proposed in the literature. In addition, the proposed entropy can be reduced to Shannon entropy if the BPA is a probability distribution. Numerical examples are presented to show the efficiency and superiority of the proposed measure as well as an application in decision making.


2014 ◽  
Vol 15 (1) ◽  
pp. 79-116 ◽  
Author(s):  
KIM BAUTERS ◽  
STEVEN SCHOCKAERT ◽  
MARTINE DE COCK ◽  
DIRK VERMEIR

AbstractAnswer Set Programming (ASP) is a popular framework for modelling combinatorial problems. However, ASP cannot be used easily for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, whereas this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.


2003 ◽  
Vol 5 (4) ◽  
pp. 215-232 ◽  
Author(s):  
Jim W. Hall

Hydroinformatics combines topics of modelling and decision-making, both of which have attracted a great deal of attention outside hydroinformatics from the point of view of uncertainty. Epistemic uncertainties are due to the inevitably incomplete evidence about the dependability of a model or set of competing models. Inherent uncertainties are due to the varying information content inherent in measurements or model predictions, be they probabilistic or fuzzy. Decision-making in management of the aquatic environment is, more often than not, a complex, discursive, multi-player process. The requirement for hydroinformatics systems is to support rather than replace human judgment in this process, a requirement that has significant bearing on the treatment of uncertainty. Furthermore, a formal language is required to encode uncertainty in computer systems. We therefore review the modern mathematics of uncertainty, starting first with probability theory and then extending to fuzzy set theory and possibility theory, the theory of evidence (and its random set counterpart), which generalises probability and possibility theory, and higher-order generalisations. A simple example from coastal hydraulics illustrates how a range of types of uncertain information (including probability distributions, interval measurements and fuzzy sets) can be handled in the types of algebraic or numerical functions that form the kernel of most hydroinformatic systems.


2017 ◽  
Vol 88 ◽  
pp. 237-258 ◽  
Author(s):  
Khaoula Boutouhami ◽  
Salem Benferhat ◽  
Faiza Khellaf ◽  
Farid Nouioua

Optik ◽  
2014 ◽  
Vol 125 (16) ◽  
pp. 4583-4587 ◽  
Author(s):  
Linna Ji ◽  
Fengbao Yang ◽  
Xiaoxia Wang ◽  
Lei Chen

2020 ◽  
Vol 29 (03n04) ◽  
pp. 2060005
Author(s):  
Amélie Levray ◽  
Salem Benferhat ◽  
Karim Tabia

Possibilistic graphical models are powerful modeling and reasoning tools for uncertain information based on possibility theory. In this paper, we provide an analysis of computational complexity of MAP and MPE queries for possibilistic networks. MAP queries stand for maximum a posteriori explanation while MPE ones stand for most plausible explanation. We show that the decision problems of answering MAP and MPE queries in both min-based and product-based possibilistic networks is NP-complete. Definitely, such results represent an advantage of possibilistic graphical models over probabilistic ones since MAP queries are NPPP -complete in Bayesian networks. Our proofs for querying min-based possibilistic networks make use of reductions from the 3SAT problem to querying possibilistic networks decision problem. Moreover, the provided reductions may be useful for the implementation of MAP and MPE inference engines based on the satisfiability problem solvers. As for product-based networks, the provided proofs are incremental and make use of reductions from SAT and its weighted variant WMAXSAT.


Sign in / Sign up

Export Citation Format

Share Document