CLP(BN): Constraint Logic Programming for Probabilistic Knowledge

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.

• Type: Conference
• Year: 2003
• Where: UAI
• Authors: Vítor Santos Costa, David Page, Maleeha Qazi, James Cussens
• Keywords: Logic Programming, Missing Values, Skolem, UAI 2003, UAI 2008