next up previous
Next: About this document ... Up: The Alchemy System for Previous: 5.3 Linked-In Functions and

Bibliography

1
P. J. Acklam.
An algorithm for computing the inverse normal cumulative distribution function.
2003.
http://home.online.no/~pjacklam/notes/invnorm/impl/misra/normsinv.html.

2
H. Kautz, B. Selman, and Y. Jiang.
A general stochastic approach to solving problems with hard and soft constraints.
In D. Gu, J. Du, and P. Pardalos, editors, The Satisfiability Problem: Theory and Applications, pages 573-586. American Mathematical Society, New York, NY, 1997.
http://www.cs.washington.edu/homes/kautz/walksat/.

3
S. Kok and P. Domingos.
Learning the structure of Markov logic networks.
In Proceedings of the Twenty-Second International Conference on Machine Learning, pages 441-448, Bonn, Germany, 2005. ACM Press.

4
S. Kok, P. Singla, M. Richardson, and P. Domingos.
The Alchemy system for statistical relational AI.
Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA, 2005.
http://www.cs.washington.edu/ai/alchemy/.

5
E. Marinari and G. Parisi.
Simulated tempering: A new Monte Carlo scheme.
Europhysics Letters, 19:451-458, 1992.

6
H. Poon and P. Domingos.
Sound and efficient inference with probabilistic and deterministic dependencies.
In Proceedings of the Twenty-First National Conference on Artificial Intelligence, Boston, MA, 2006. AAAI Press.
To appear.

7
M. Richardson and P. Domingos.
Markov logic networks.
Machine Learning, 2005.
To appear.

8
S. Russell and P. Norvig.
Artificial Intelligence: A Modern Approach, chapter 8.
Prentice Hall, Upper Saddle River, NJ, 2002.
http://aima.cs.berkeley.edu/lisp/doc/overview-LOGIC.html.

9
P. Singla and P. Domingos.
Discriminative training of Markov logic networks.
In Proceedings of the Twentieth National Conference on Artificial Intelligence, pages 868-873, Pittsburgh, PA, 2005. AAAI Press.

10
P. Singla and P. Domingos.
Memory-efficient inference in relational domains.
In Proceedings of the Twenty-First National Conference on Artificial Intelligence, Boston, MA, 2006. AAAI Press.
To appear.

11
W. Wei, J. Erenrich, and B. Selman.
Towards efficient sampling: Exploiting random walk strategies.
In Proceedings of the Nineteenth National Conference on Artificial Intelligence. AAAI Press, 2004.

12
C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal.
Algorithm 778: L-BFGS-B, FORTRAN routines for large scale bound constrained optimization.
ACM Transactions on Mathematical Software, 23(4):550-560, 1997.
http://www.ece.northwestern.edu/~nocedal/lbfgsb.html.



Marc Sumner 2007-01-16