CLP(BN): Constraint logic programming for probabilistic knowledge
Publication
, Journal Article
Santos Costa, V; Page, D; Cussens, J
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
March 10, 2008
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.
Duke Scholars
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
March 10, 2008
Volume
4911 LNAI
Start / End Page
156 / 188
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
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
Santos Costa, V., D. Page, and J. Cussens. “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 (March 10, 2008): 156–88. https://doi.org/10.1007/978-3-540-78652-8_6.
Santos Costa V, Page D, Cussens J. 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). 2008 Mar 10;4911 LNAI:156–88.
Santos Costa, V., et al. “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), vol. 4911 LNAI, Mar. 2008, pp. 156–88. Scopus, doi:10.1007/978-3-540-78652-8_6.
Santos Costa V, Page D, Cussens J. 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). 2008 Mar 10;4911 LNAI:156–188.
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
March 10, 2008
Volume
4911 LNAI
Start / End Page
156 / 188
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences