Prolog issues and experimental results of an MCMC algorithm

N Angelopoulos; J Cussens

Prolog issues and experimental results of an MCMC algorithm

N Angelopoulos, J Cussens

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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	English
Title of host publication	WEB KNOWLEDGE MANAGEMENT AND DECISION SUPPORTS
Editors	O Bartenstein, U Geske, M Hannebauer, O Yoshie
Place of Publication	BERLIN
Publisher	Springer
Pages	186-196
Number of pages	11
ISBN (Print)	3-540-00680-X
Publication status	Published - 2003
Event	14th International Conference on Applications of Prolog - TOKYO Duration: 20 Oct 2001 → 22 Oct 2001

Conference

Conference	14th International Conference on Applications of Prolog
City	TOKYO
Period	20/10/01 → 22/10/01

Keywords

LOGIC PROGRAMS

Cite this

@inproceedings{b98804e58a7143d3a0cc2b3aad59f315,

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

keywords = "LOGIC PROGRAMS",

author = "N Angelopoulos and J Cussens",

year = "2003",

language = "English",

isbn = "3-540-00680-X",

pages = "186--196",

editor = "O Bartenstein and U Geske and M Hannebauer and O Yoshie",

booktitle = "WEB KNOWLEDGE MANAGEMENT AND DECISION SUPPORTS",

publisher = "Springer",

address = "Germany",

note = "14th International Conference on Applications of Prolog ; Conference date: 20-10-2001 Through 22-10-2001",

}

TY - GEN

T1 - Prolog issues and experimental results of an MCMC algorithm

AU - Angelopoulos, N

AU - Cussens, J

PY - 2003

Y1 - 2003

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.

KW - LOGIC PROGRAMS

M3 - Conference contribution

SN - 3-540-00680-X

SP - 186

EP - 196

BT - WEB KNOWLEDGE MANAGEMENT AND DECISION SUPPORTS

A2 - Bartenstein, O

A2 - Geske, U

A2 - Hannebauer, M

A2 - Yoshie, O

PB - Springer

CY - BERLIN

T2 - 14th International Conference on Applications of Prolog

Y2 - 20 October 2001 through 22 October 2001

ER -