Distributional logic programming for Bayesian knowledge representation

Angelopoulos, Nicos ORCID: https://orcid.org/0000-0002-7507-9177 and Cussens, James 2017. Distributional logic programming for Bayesian knowledge representation. International Journal of Approximate Reasoning 80 , pp. 52-66. 10.1016/j.ijar.2016.08.004

Full text not available from this repository.

Abstract

We present a formalism for combining logic programming and its flavour of nondeterminism with probabilistic reasoning. In particular, we focus on representing prior knowledge for Bayesian inference. Distributional logic programming (Dlp), is considered in the context of a class of generative probabilistic languages. A characterisation based on probabilistic paths which can play a central role in clausal probabilistic reasoning is presented. We illustrate how the characterisation can be utilised to clarify derived distributions with regards to mixing the logical and probabilistic constituents of generative languages. We use this operational characterisation to define a class of programs that exhibit probabilistic determinism. We show how Dlp can be used to define generative priors over statistical model spaces. For example, a single program can generate all possible Bayesian networks having N nodes while at the same time it defines a prior that penalises networks with large families. Two classes of statistical models are considered: Bayesian networks and classification and regression trees. Finally we discuss: (1) a Metropolis–Hastings algorithm that can take advantage of the defined priors and the probabilistic choice points in the prior programs and (2) its application to real-world machine learning tasks.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Medicine
Publisher:	Elsevier
ISSN:	0888-613X
Date of Acceptance:	8 August 2016
Last Modified:	04 Jan 2023 02:19
URI:	https://orca.cardiff.ac.uk/id/eprint/133811

Citation Data

Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item