Asymptotic conditional probabilities: The non-unary case

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 {1, . . . , N} 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’kĭı [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’kĭı 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. ∗Some of this research was done while all three authors were at IBM Almaden Research Center. During this work, the first author was at Stanford University, and was supported by an IBM Graduate Fellowship. This research was sponsored in part by the Air Force Office of Scientific Research (AFSC), under Contract F4962091-C-0080. The United States Government is authorized to reproduce and distribute reprints for governmental purposes. Some of this research appeared in preliminary form in a paper entitled “Asymptotic conditional probabilities for first-order logic”, which appears in Proceedings 24th ACM Symp. on Theory of Computing, 1992, pages 294–305. This paper appears in the Journal of Symbolic Logic.

[1]  E. T. Jaynes,et al.  Where do we Stand on Maximum Entropy , 1979 .

[2]  Peter C. Cheeseman,et al.  A Method of Computing Generalized Bayesian Probability Values for Expert Systems , 1983, IJCAI.

[3]  Hector J. Levesque,et al.  Reasoning about Noisy Sensors in the Situation Calculus , 1995, IJCAI.

[4]  H. Jeffreys.  A Treatise on Probability , 1922, Nature.

[5]  B. Dreben,et al.  The decision problem: Solvable classes of quantificational formulas , 1979 .

[6]  Joseph Y. Halpern,et al.  From Statistical Knowledge Bases to Degrees of Belief , 1996, Artif. Intell..

[7]  M. I. Liogon'kii.  On the conditional degree of satisfiability of logical formulas , 1969 .

[8]  Phokion G. Kolaitis,et al.  0-1 laws and decision problems for fragments of second-order logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[9]  Joseph Y. Halpern,et al.  Statistical Foundations for Default Reasoning , 1993, IJCAI.

[10]  R. Baierlein,et al.  Entropy in relation to incomplete knowledge , 1985 .

[11]  Ronald Fagin,et al.  The number of finite relational structures , 1977, Discret. Math..

[12]  Yu. V. Glebskii,et al.  Range and degree of realizability of formulas in the restricted predicate calculus , 1969 .

[13]  H. Jeffreys.  Logical Foundations of Probability , 1952, Nature.

[14]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.

[15]  Harry R. Lewis,et al.  Unsolvable classes of quantificational formulas , 1979 .

[16]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[17]  Joseph Y. Halpern,et al.  Random Worlds and Maximum Entropy , 1994, J. Artif. Intell. Res..

[18]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[19]  Joseph Y. Halpern,et al.  Asymptotic Conditional Probabilities: The Unary Case , 1996, SIAM J. Comput..

[20]  Phokion G. Kolaitis,et al.  0-1 Laws and Decision Problems for Fragments of Second-Order Logic , 1990, Inf. Comput..

[21]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[22]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[23]  Jeff B. Paris,et al.  On the applicability of maximum entropy to inexact reasoning , 1989, Int. J. Approx. Reason..

[24]  J. Lynch.  Almost sure theories , 1980 .

[25]  H. Gaifman.  Concerning measures in first order calculi , 1964 .

[26]  Rudolf Carnap,et al.  The continuum of inductive methods , 1952 .

[27]  J. Lynch.  Probabilities of first-order sentences about unary functions , 1985 .

[28]  A. Mostowski.  Review: B. A. Trahtenbrot, Impossibility of an Algorithm for the Decision Problem in Finite Classes , 1950, Journal of Symbolic Logic.