ACM Home Page
Please provide us with feedback. Feedback
Report on the probabilistic language scheme
Full text PdfPdf (160 KB)
Source
Dynamic Languages Symposium archive
Proceedings of the 2007 symposium on Dynamic languages table of contents
Montreal, Quebec, Canada
SESSION: Multi-paradigm programming table of contents
Pages: 2 - 10  
Year of Publication: 2007
ISBN:978-1-59593-868-8
Author
Alexey Radul  Massachusetts Institute of Technology, Cambridge, MA
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 28,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1297081.1297085
What is a DOI?

ABSTRACT

Reasoning with probabilistic models is a widespread and successful technique in areas ranging from computer vision, to natural language processing, to bioinformatics. Currently, these reasoning systems are either coded from scratch in general-purpose languages or use formalisms such as Bayesian networks that have limited expressive power. In both cases, the resulting systems are difficult to modify, maintain, compose, and interoperate with. This work presents Probabilistic Scheme, an embedding of probabilistic computation into Scheme. This gives programmers an expressive language for implementing modular probabilistic models that integrate naturally with the rest of Scheme.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
F. Bacchus, S. Dalmao, and T. Pitassi. Value elimination: Bayesian inference via backtracking search, 2003.
 
3
4
 
5
 
6
J. McCarthy. A Basis for a Mathematical Theory of Computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems. North-Holland, Amsterdam, 1963.
 
7
B. Milch, B. Marthi, S. Russell, D. Sontag, D. Ong, and A. Kolobov. BLOG: Probabilistic models with unknown objects. Proceedings of the Nineteenth Joint Conference on Artificial Intelligence, 2005.
 
8
A. Pfeffer. IBAL: A probabilistic rational programming language. In IJCAI, pages 733--740, 2001.
9
 
10
 
11
M. Sahami, S. Dumais, D. Heckerman, and E. Horvitz. A Bayesian approach to filtering junk e-mail. Learning for Text Categorization: Papers from the 1998 Workshop, 62, 1998.
 
12
E. Segal, B. Taskar, A. Gasch, N. Friedman, and D. Koller. Rich probabilistic models for gene expression. Bioinformatics, 17(Suppl 1):S243--52, 2001.
 
13
D. Spiegelhalter, A. Thomas, N. Best, and W. Gilks. BUGS: Bayesian inference using Gibbs sampling. MRC Biostatistics Unit, Cambridge, England. www. mrc-bsu. cam. ac. uk/bugs, 1994.
 
14
R. M. Stallman and G. J. Sussman. Forward reasoning and dependency directed backtracking in a system for computer-aided circuit analysis. AI Memo 380, MIT Artificial Intelligence Laboratory, September 1976.
 
15
S. Thrun, M. Montemerlo, and A. Aron. Probabilistic Terrain Analysis For High-Speed Desert Driving. Proc. Robotics Science and Systems, Philadelphia, PA, USA, August, pages 16--19, 2006.