Prolog Issues and Experimental Results of an MCMC Algorithm
We present a Markov chain Monte Carlo algorithm that operates on generic model structures that are represented by terms found in the computed answers produced by stochastic logic programs. The objective of this paper is threefold (a) to show that SLD-trees are an elegant means for describing prior distributions over model structures (b) to sketch an implementation of the MCMC algorithm in Prolog, and (c) to provide insights on desirable properties for SLPs.
KeywordsMarkov Chain Markov Chain Monte Carlo Hard Constraint Markov Chain Monte Carlo Algorithm Inductive Logic Programming
Unable to display preview. Download preview PDF.
- Angelopoulos, N., & Cussens, J. (2001). Markov chain Monte Carlo using tree-based priors on model structure. In Breese, J., & Koller, D. (Eds.), Proc. of the 17th Annual Conf. on Uncertainty in Artificial Intelligence (UAI-2001), pp. 16–23 Seattle. Morgan Kaufmann.Google Scholar
- Gilks, W. R., Richardson, S., & Spiegelhlater, D. J}. (Eds.). (1996). Markov Chain Monte Carlo in Practise. Chapman & Hall.Google Scholar
- Kameya, Y., & Sato, T. (2000). Effficient EM learning with tabulation for parameterized logic programs. In Proc. of the First International Conf. on Computational Logic (CL 2000), Vol. 1861 of LNAI, pp. 269–284 London. Springer.Google Scholar
- Pfeffer, A. (2001). IBAL: A probablistic rational programming language. In Proc. of the Seventeenth International Joint Conference on AI (IJCAI-01).Google Scholar
- Riezler, S. (1998). Probabilistic Constraint Logic Programming. Ph.D. thesis, Universität Tübingen. AIMS Report 5(1), 1999, IMS, Universität Stuttgart.Google Scholar