Prolog Issues and Experimental Results of an MCMC Algorithm

Nicos Angelopoulos; James Cussens

doi:10.1007/3-540-36524-9_15

Prolog Issues and Experimental Results of an MCMC Algorithm

Nicos Angelopoulos, James Cussens

Computer Science

Research output: Contribution to conference › Paper › peer-review

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.

Original language	Undefined/Unknown
Pages	186-196
DOIs	https://doi.org/10.1007/3-540-36524-9_15
Publication status	Published - 2001

Access to Document

10.1007/3-540-36524-9_15

http://link.springer.de/link/service/series/0558/bibs/2543/25430186.htm

Cite this

@conference{dc657fa10e914da39fd089d3dbee6406,

title = "Prolog Issues and Experimental Results of an MCMC Algorithm",

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. ",

author = "Nicos Angelopoulos and James Cussens",

year = "2001",

doi = "10.1007/3-540-36524-9_15",

language = "Undefined/Unknown",

pages = "186--196",

}

TY - CONF

T1 - Prolog Issues and Experimental Results of an MCMC Algorithm

AU - Angelopoulos, Nicos

AU - Cussens, James

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-36524-9_15

DO - 10.1007/3-540-36524-9_15

M3 - Paper

SP - 186

EP - 196

ER -