Prolog issues and experimental results of an MCMC algorithm

  • Authors:
  • Nicos Angelopoulos;James Cussens

  • Affiliations:
  • University of York, Heslington, York, UK;University of York, Heslington, York, UK

  • Venue:
  • INAP'01 Proceedings of the Applications of prolog 14th international conference on Web knowledge management and decision support
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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