Open AccessProceedings Article
Computing probability intervals under independency constraints
Linda C. van der Gaag
- 27 Jul 1990
- pp 457-466
31
TL;DR: This work presents a method for computing probability interval! for probabilities of interest from a partial specification of a joint probability distribution, and improves on earlier approaches by all owing for independency relation ships between statistical variables to be exploited.
read more
Abstract: Many AI researchers argue that probability theory is only capable of dealing with uncertainty in situations where a fully specified joint probability distribution is available, and conclude that it is not suitable for application in AI systems. Probability intervals, however, constitute a means for expressing incompleteness of information. We present a method for computing probability interval! for probabilities of interest from a partial specification of a joint probability distribution. Our method improves on earlier approaches by all owing for independency relation ships between statistical variables to be exploited .
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Different methods are needed to propagate ignorance and variability
Scott Ferson,Lev R. Ginzburg +1 more
TL;DR: It is argued that the two kinds of uncertainty should be propagated through mathematical expressions with different calculation methods, basically, interval analysis should be used to propagate ignorance, and probability theory should beused to propagate variability.
669
Measures of uncertainty in expert systems
TL;DR: Each of the four measures seems to be useful in special kinds of problems, but only lower and upper previsions appear to be sufficiently general to model the most common types of uncertainty.
448
Anytime deduction for probabilistic logic
Alan M. Frisch,Peter Haddawy +1 more
TL;DR: The deduction method presented here contrasts with other methods whose ability to perform logical reasoning is either limited or requires finding all truth assignments consistent with the given sentences.
139
Probabilistic deduction with conditional constraints over basic events
TL;DR: In this paper, the problem of probabilistic deduction with conditional constraints over basic events is shown to be NP-hard, and a local approach is proposed to solve it in polynomial time in the size of the conditional constraint trees.
Constraint propagation with imprecise conditional probabilities
Stéphane Amarger,Didier Dubois,Henri Prade +2 more
- 13 Jul 1991
TL;DR: In this paper, an approach to reasoning with default rules where the proportion of exceptions, or more generally the probability of encountering an exception, can be at least roughly assessed is presented.
90