Church: A language for generative models

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 220-229

  Goodman, Noah D ^a   Mansinghka, Vikash K ^a   Roy, Daniel ^a   Bonawitz, Keith ^a   Tenenbaum, Joshua B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING MODEL; CONDITIONAL DISTRIBUTION; GENERALIZED BAYES; GENERATIVE MODEL; INFERENCE TECHNIQUES; LAMBDA CALCULUS; LANGUAGE CONSTRUCTS; LANGUAGE FEATURES; MONTE CARLO TECHNIQUES; NON-PARAMETRIC; NON-PARAMETRIC MODEL; PROBABILISTIC MODELING;

ARTIFICIAL INTELLIGENCE; DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; MODELS; MONTE CARLO METHODS; RELIGIOUS BUILDINGS; SEMANTICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

LISP (PROGRAMMING LANGUAGE);

EID: 70049098573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. H. Abelson and G. Sussman. Structure and Interpretation of Computer Programs. MIT Press, 1996.
2. M.J. Beal, Z. Ghahramani, and C.E. Rasmussen. The infinite hidden Markov model. NIPS 14, 2002.
3. K. A. Bonawitz. Composable Probabilistic Inference with Blaise. PhD thesis, MIT, 2008.
4. A. Church. A Set of Postulates for the Foundation of Logic. The Annals of Mathematics, 33(2):346-366, 1932.
5. M. Johnson, T. Griffiths, and S. Goldwater. Adaptor grammars: A framework for specifying compositional nonparametric Bayesian models. NIPS 19, 2007.
6. R. Kelsey, W. Clinger, and J. Rees (eds.). Revised5 Report on the Algorithmic Language Scheme. Higher- Order and Symbolic Computation, 11(1):7-105, 1998.
7. C. Kemp, J.B. Tenenbaum, T.L. Griffiths, T. Yamada, and N. Ueda. Learning systems of concepts with an infinite relational model. Proc. 21st Natl Conf. Artif. Intell., AAAI Press, 2006.
8. P. Liang, S. Petrov, M.I. Jordan, and D. Klein. The Infinite PCFG using Hierarchical Dirichlet Processes. Proc. EMNLP-CoNLL, 2007.
9. D.J. Lunn, A. Thomas, N. Best, and D. Spiegelhalter. WinBUGS-A Bayesian modelling framework: Concepts, structure, and extensibility. Statistics and Computing, 10(4):325-337, 2000.
10. D. McAllester, B. Milch, and N. D. Goodman. Random-world semantics and syntactic independence for expressive languages. Technical Report MIT-CSAIL-TR-2008-025, Massachusetts Institute of Technology, 2008.
11. J. McCarthy. A Basis for a Mathematical Theory of Computation. In Computer Programming and Formal Systems, pages 33-70, 1963.
12. B. Milch, B. Marthi, S. Russell, D. Sontag, D.L. Ong, and A. Kolobov. BLOG: Probabilistic models with unknown objects. Proc. IJCAI, 2005.
13. S. Muggleton. Stochastic logic programs. In L. de Raedt, editor, Advances in Inductive Logic Programming, pages 254-264. IOS Press, 1996.
14. A. Pfeffer. IBAL: A probabilistic rational programming language. Proc. IJCAI, 2001.
15. J. Pitman. Combinatorial stochastic processes, 2002. Notes for Saint Flour Summer School.
16. A. Radul. Report on the probabilistic language scheme. Technical Report MIT-CSAIL-TR-2007-059, Massachusetts Institute of Technology, 2007.
17. J.C. Reynolds. Definitional interpreters for higherorder programming. ACM Annual Conference, pages 717-740, 1972.
18. M. Richardson and P. Domingos. Markov logic networks. Machine Learning, 62(1):107-136, 2006. (Pubitemid 43202307)
19. T. Sato and Y. Kameya. PRISM: A symbolicstatistical modeling language. In International Joint Conference on Artificial Intelligence, 1997.
20. J. Sethuraman. A Constructive definition of Dirichlet priors. Statistica Sinica, 4, 1994.
21. M. Toussaint, S. Harmeling, and A. Storkey. Probabilistic inference for solving (PO)MDPs. Technical Report EDI-INF-RR-0934, University of Edinburgh, 2006.