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.
|Number of pages||11|
|Place of Publication||BERLIN|
|Publication status||Published - 2003|
- LOGIC PROGRAMS