1. Angelopoulos, N., & Cussens, J. (2004). On the implementation of MCMC proposals over stochastic logic programs. In M. Carro & J. F. Morales (Eds.), Proceedings of the colloquium on implementation of constraint and logic programming systems (CICLOPS-04).
2. Arora, N. S., de Salvo Braz, R., Sudderth, E. B., & Russell, S. J. (2010). Gibbs sampling in open-universe stochastic languages. In P. Grünwald & P. Spirtes (Eds.), Proceedings of the 26th conference on uncertainty in artificial intelligence (UAI-10) (pp. 30–39). AUAI Press.
3. Bancilhon, F., Maier, D., Sagiv, Y., & Ullman, J. D. (1986). Magic sets and other strange ways to implement logic programs (extended abstract). In A. Silberschatz (Ed.), Proceedings of the 5th ACM SIGACT-SIGMOD symposium on principles of database systems (PODS-86) (pp. 1–15). ACM.
4. Baral, C., Gelfond, M., & Rushton, J. N. (2004). Probabilistic reasoning with answer sets. In V. Lifschitz & I. Niemelä (Eds.), Proceedings of the 7th international conference on logic programming and nonmonotonic reasoning (LPNMR-04), Lecture Notes in Computer Science, (Vol. 2923, pp. 21–33). Springer.
5. Baral, C., Gelfond, M., & Rushton, N. (2009). Probabilistic reasoning with answer sets. Theory and Practice of Logic Programming (TPLP), 9(1), 57–144.