论文信息 - Logical Prior Probability - 字舞流文

Logical Prior Probability

A Bayesian prior over first-order theories is defined. It is shown that the prior can be approximated, and the relationship to previously studied priors is examined.

[1] Douglas B. Lenat,et al. Why AM and EURISKO Appear to Work , 1984, Artif. Intell..

[2] George Boolos,et al. Computability and logic , 1974 .

[3] Paul M. B. Vitányi,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.

[4] Michael J. Dinneen,et al. A computational attack on the conjectures of Graffiti: New counterexamples and proofs , 1995, Discret. Math..

[5] Brian Weatherson. From Classical to Intuitionistic Probability , 2003, Notre Dame J. Formal Log..

[6] Haim Gaifman,et al. Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements , 2004, Synthese.

[7] Jürgen Schmidhuber,et al. Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit , 2002, Int. J. Found. Comput. Sci..

[8] Dieter Jungnickel,et al. Relative difference sets with n = 2 , 1995, Discret. Math..

[9] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.