Asymptotic conditional probabilities: The non-unary case

Journal of Symbolic Logic

Volumn 61, Issue 1, 1996, Pages 250-276

  Grove, Adam J ^a   Halpern, Joseph Y ^b   Koller, Daphne ^c  

^a NEC LABORATORIES AMERICA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030555632     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275609     Document Type: Article

References (32)

1. F. BACCHUS, A. J. GROVE, J. Y. HALPERN, and D. KOLLER, From statistics to belief, Proceedings of the national conference on artificial intelligence (AAAI '92). 1992, pp. 602-608.
2. _, Statistical foundations for default reasoning, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI '93), 1993 , A longer version, entitled From statistical knowledge bases to degrees of belief will appear in Artificial Intelligence.
3. _, Statistical foundations for default reasoning, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI '93), 1993 , A longer version, entitled From statistical knowledge bases to degrees of belief will appear in Artificial Intelligence.
4. R. CARNAP, Logical foundations of probability, University of Chicago Press, Chicago, 1950.
5. _, The continuum of inductive methods, University of Chicago Press, Chicago, 1952.
6. P. C. CHEESEMAN, A method of computing generalized Bayesian probability values for expert systems, Proceedings of the eighth international joint conference on artificial intelligence (IJCAI '83), 1983, pp. 198-202.
7. K. COMPTON, 0-1 laws in logic and combinatorics, Proceedings of the 1987 NATO advanced study institute on algorithms and order (I. Rival, editor), Reidel, Dordrecht, Netherlands, 1988, pp. 353-383.
8. P. S. DE LAPLACE, Essai philosophique sur les probabilités, 1820, English translation is Philosophical Essay on Probabilities, Dover Publications, New York, 1951.
9. P. S. DE LAPLACE, Essai philosophique sur les probabilités, 1820, English translation is Philosophical Essay on Probabilities, Dover Publications, New York, 1951.
10. K. G. DENBIGH and J. S. DENBIGH, Entropy in relation to incomplete knowledge, Cambridge University Press, Cambridge, UK, 1985.
11. B. DREBEN and W. D. GOLDFARB, The decision problem: Solvable classes of quantificational formulas, Addison-Wesley, Reading, MA, 1979.
12. R. FAGIN, Probabilities on finite models, this JOURNAL, vol. 41 (1976), no. 1, pp. 50-58.
13. _, The number of finite relational structures, Discrete Mathematics, vol. 19 ( 1977), pp. 17-21.
14. H. GAIFMAN, Probability models and the completeness theorem, International congress of logic methodology and philosophy of science, 1960, This is the abstract of which [13] is the full paper, pp. 77-78.
15. _, Concerning measures in first order calculi, Israel Journal of Mathematics, vol. 2 (1964), pp. 1-18.
16. Y. V. GLEBSKIǏ, M. I. LIOGON'KIǏ D. I. KOGAN, and V. A. TALANOV, Range and degree of realizability of formulas in the restricted predicate calculus, Kibernetika, vol. 2 (1969), pp. 17-28.
17. R. L. GRAHAM, D. E. KNUTH, and O. PATASHNIK, Concrete mathematics - a foundation for computer science, Addison-Wesley, Reading, MA, 1989.
18. A. J. GROVE, J. Y. HALPERN, and D. KOLLER, Asymptotic conditional probabilities for first-order logic, Part II: the unary case, Research report, IBM, 1993, SIAM Journal on Computing, in press.
19. _, Asymptotic conditional probabilities for first-order logic, Proc. 24th ACM symp. on theory of computing, 1992, pp. 294-305.
20. _, Random worlds and maximum entropy, Journal of Artificial Intelligence Research, vol. 2 (1994), pp. 33-38.
21. JR. H. ROGERS, Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.
22. E. T. JAYNES, Where do we stand on maximum entropy?, The maximum entropy formalism (R. D. Levine and M. Tribus, editors). MIT Press, 1978, pp. 15-118.
23. J. M. KEYNES, A treatise on probability, Macmillan, London 1921.
24. PH. G. KOLAITIS and M. Y. VARDI, 0-1 laws and decision problems for fragments of second-order logic, Information and Computation, vol. 87 (1990), pp. 302-338.
25. H. R. LEWIS, Unsolvable classes of quantificationalformulas, Addison-Wesley, New York, 1979.
26. M. I. LIOGON'KIǏ, On the conditional satisfiability ratio of logical formulas, Mathematical Notes of the Academy of the USSR, vol. 6 (1969), pp. 856-861.
27. J. LYNCH, Almost sure theories, Annals of Mathematical Logic, vol. 18 (1980), pp. 91-135.
28. Z. MANNA and A. PNUELI, The temporal logic of reactive and concurrent systems, vol. 1, Springer-Verlag, Berlin, 1992.
29. J. B. PARIS and A. VENCOVSKA, On the applicability of maximum entropy to inexact reasoning, International Journal of Approximate Reasoning, vol. 3 (1989), pp. 1-34.
30. R. E. POWELL and S. M. SHAH, Summability theory and applications, Van Nostrand Reinhold, 1972.
31. B. A. TRAKHTENBROT, Impossibility of an algorithm for the decision problem in finite classes, Doklady Akademii Nauk SSSR, vol. 70 (1950), pp. 569-572.
32. J. VON KRIES, Die principien der Wahrscheinlichkeitsrechnung und rational expectation, Freiburg, 1886.