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.
|Title of host publication||constraint logic programming for probabilistic knowledge|
|Editors||Luc De Raedt, Paolo Frasconi, Kristian Kersting, Stephen Muggleton|
|Place of Publication||Berlin|
|Number of pages||33|
|Publication status||Published - 2008|
|Name||Lecture Notes in Artificial Intelligence|