Hybrid Probabilistic Programs: Algorithms and Complexity (1999)
Cached
Download Links
- [users.csc.calpoly.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings UAI-99 |
| Citations: | 19 - 3 self |
BibTeX
@INPROCEEDINGS{Dekhtyar99hybridprobabilistic,
author = {Michael I. Dekhtyar},
title = {Hybrid Probabilistic Programs: Algorithms and Complexity},
booktitle = {In Proceedings UAI-99},
year = {1999},
pages = {160--169}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
1 Introduction Computing the probability of a complex event from the probability of the primitive events constituting it depends upon the dependencies (if any) known to exist between the events being composed. For example, consider two events e1; e2. The probability, P(e1 ^ e2) of the occurrence of both is events is 0 if the events are mutually exclusive. However, if the events are independent, then P(e1 ^ e2) = P(e1) \Theta P(e2). If we are ignorant of the relationship between these two events, then, as stated by Boole[1], the best we can say about P(e1 ^ e2) is that it lies in the interval [max(0; P(e1) + P(e2) \Gamma 1); min(P(e1); P(e2)]. In short, computing the probability of a complex event depends fundamentally upon our knowledge about the dependences between the events involved. In [2] we proposed a language called Hybrid Probabilistic (Logic)
