CLP(BN )

V. Santos Costa, D. Page, J. Cussens

Research output: Chapter in Book/Report/Conference proceedingChapter in a book

Abstract

In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represented by terms built from Skolem functors. The CLP(BN) language represents the joint probability distribution over missing values in a database or logic program by using constraints to represent Skolem functions. Algorithms from inductive logic programming (ILP) can be used with only minor modification to learn CLP(BN) programs. An implementation of CLP(BN) is publicly available as part of YAP Prolog at http://www.ncc.up.pt/~vsc/Yap.
Original languageEnglish
Title of host publicationconstraint logic programming for probabilistic knowledge
EditorsLuc De Raedt, Paolo Frasconi, Kristian Kersting, Stephen Muggleton
Place of PublicationBerlin
PublisherSpringer
Pages156-188
Number of pages33
ISBN (Print)978-3-540-78651-1
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Artificial Intelligence

Cite this

Santos Costa, V., Page, D., & Cussens, J. (2008). CLP(BN ). In L. De Raedt, P. Frasconi, K. Kersting, & S. Muggleton (Eds.), constraint logic programming for probabilistic knowledge (pp. 156-188). (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-540-78652-8_6