DMCA
Asymptotic Conditional Probabilities: The Non-unary Case (1993)
Cached
Download Links
- [robotics.stanford.edu]
- [simon.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | J. SYMBOLIC LOGIC |
| Citations: | 10 - 3 self |
BibTeX
@ARTICLE{Grove93asymptoticconditional,
author = {Adam J. Grove and Joseph Y. Halpern and Daphne Koller},
title = {Asymptotic Conditional Probabilities: The Non-unary Case},
journal = {J. SYMBOLIC LOGIC},
year = {1993},
volume = {61},
pages = {61--1}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences ' and `, we consider the structures with domain f1; : : : ; Ng that satisfy `, and compute the fraction of them in which ' is true. We then consider what happens to this fraction as N gets large. This extends the work on 0-1 laws that considers the limiting probability of first-order sentences, by considering asymptotic conditional probabilities. As shown by Liogon'kii [Lio69], if there is a non-unary predicate symbol in the vocabulary, asymptotic conditional probabilities do not always exist. We extend this result to show that asymptotic conditional probabilities do not always exist for any reasonable notion of limit. Liogon'kii also showed that the problem of deciding whether the limit exists is undecidable. We analyze the complexity of three problems with respect to this limit: deciding whether it is well-defined, whether it exists, and whether it lies in some nontrivial interval. Matching upper and lower bounds are given for all three problems, showing them to be highly undecidable.
