Name
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 |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-36524-9_15 | INAP (LNCS Volume) |
Keywords | Field | DocType |
computed answer,model structure,stochastic logic program,generic model structure,monte carlo algorithm,mcmc algorithm,desirable property,prior distribution,prolog issue,markov chain,elegant mean | Inductive logic programming,Markov chain Monte Carlo,Computer science,Markov chain,Markov chain monte carlo algorithm,Algorithm,Theoretical computer science,Stochastic logic,Prolog,Sketch | Conference |
Volume | ISSN | ISBN |
2543 | 0302-9743 | 3-540-00680-X |
Citations | PageRank | References |
1 | 0.39 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicos Angelopoulos | 1 | 53 | 11.48 |
| James Cussens | 2 | 503 | 50.29 |