## Interpreting Bayesian Logic Programs (2001)

### Cached

### Download Links

- [www.informatik.uni-freiburg.de]
- [robotics.stanford.edu]
- [SunSITE.Informatik.RWTH-Aachen.DE]
- [www.aaai.org]
- [arxiv.org]
- DBLP

### Other Repositories/Bibliography

Venue: | PROCEEDINGS OF THE WORK-IN-PROGRESS TRACK AT THE 10TH INTERNATIONAL CONFERENCE ON INDUCTIVE LOGIC PROGRAMMING |

Citations: | 109 - 7 self |

### BibTeX

@INPROCEEDINGS{Kersting01interpretingbayesian,

author = {Kristian Kersting and Luc De Raedt and Stefan Kramer},

title = {Interpreting Bayesian Logic Programs},

booktitle = {PROCEEDINGS OF THE WORK-IN-PROGRESS TRACK AT THE 10TH INTERNATIONAL CONFERENCE ON INDUCTIVE LOGIC PROGRAMMING},

year = {2001},

pages = {138--155},

publisher = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

Various proposals for combining first order logic with Bayesian nets exist. We introduce the formalism of Bayesian logic programs, which is basically a simplification and reformulation of Ngo and Haddawys probabilistic logic programs. However, Bayesian logic programs are sufficiently powerful to represent essentially the same knowledge in a more elegant manner. The elegance is illustrated by the fact that they can represent both Bayesian nets and definite clause programs (as in "pure" Prolog) and that their kernel in Prolog is actually an adaptation of an usual Prolog meta-interpreter.