Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
On the applicability of maximum entropy to inexact reasoning
International Journal of Approximate Reasoning
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The power of sampling in knowledge discovery
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Statistical foundations for default reasoning
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
On the hardness of approximate reasoning
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A logic for default reasoning about probabilities
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order formulas. That is, given first-order formulas &fgr; and &thgr;, we consider the number of structures with domain {1,…,N} that satisfy &thgr;, and compute the fraction of them in which &fgr; is true. We then consider what happens to this probability of first-order formulas, except that now we are considering asymptotic conditional probabilities. Although work has been done on special cases of asymptotic conditional probabilities, no general theory has been developed. This is probably due in part to the fact that it has been known that, if there is a binary predicate symbol in the vocabulary, asymptotic conditional probabilities do not always exist. We show that in this general case, almost all the questions one might want to ask (such as deciding whether the asymptotic probability exists) are highly undecidable. On the other hand, we show that the situation with unary predicates only is much better. If the vocabulary consists only of unary predicate and constant symbols, it is decidable whether the limit exists, and if it does, there is an effective algorithm for computing it. The complexity depends on two parameters: whether there is a fixed finite vocabulary or an infinite one, and whether there is a bound on the depth of quantifier nesting.