Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Boolos, G., Burgess, J.P., Jeffrey, R.C.: Computability and Logic. Cambridge University Press (2007)
Dinneen, M., Brewster, T., Faber, V.: A computational attack on the conjectures of graffiti: New counterexamples and proofs. Discrete Mathematics 147, 1–3 (1992)
Gaifman, H.: Reasoning with limited resources and assigning probabilities to arithmetical statements. Synthese 140(1951), 97–119 (2004)
Lenat, D., Brown, J.: Why am and eurisko appear to work. Artificial Intelligence 23(3), 269–294 (1984)
Li, M., Vitányi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Graduate texts in computer science. Springer (1997)
Schmidhuber, J.: Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science 13(4), 587–612 (2002)
Weatherson, B.: From classical to intuitionistic probability. Notre Dame Journal of Formal Logic 44(2), 111–123 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demski, A. (2012). Logical Prior Probability. In: Bach, J., Goertzel, B., Iklé, M. (eds) Artificial General Intelligence. AGI 2012. Lecture Notes in Computer Science(), vol 7716. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35506-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-35506-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35505-9
Online ISBN: 978-3-642-35506-6
eBook Packages: Computer ScienceComputer Science (R0)