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( ) 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( ) programs. An implementation of CLP( ) is publicly available as part of YAP Prolog at http://www.ncc.up.pt/~vsc/Yap . © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Santos Costa, V., Page, D., & Cussens, J. (2008). CLP(BN): Constraint logic programming for probabilistic knowledge. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4911 LNAI, 156–188. https://doi.org/10.1007/978-3-540-78652-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
