Probabilistic (logic) programming concepts
Open accessThe DOI matches its Crossref record; 93 of the 93 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Artificial intelligence: a modern approach
(1995) · Choice Reviews Online · doi:10.5860/choice.33-1577 · Cited by 21,974
(1988) · Cited by 16,582
An Introduction to Statistical Learning
James, G., Witten, D., Hastie, T., & Tibshirani, R. (2013) · Springer Texts in Statistics · doi:10.1007/978-1-4614-7138-7 · Cited by 12,106
Artificial intelligence: A modern approach
Nilsson, N. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(96)00007-0 · Cited by 10,583
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676 · cited 6×
“Important representatives of this stream of research include probabilistic logic programs (PLPs) (Haddawy, 1994), relational Bayesian networks (RBNs) (Jaeger, 1997), probabilistic relational models (PRMs) (Koller and Pfeffer, 1998; Getoor et al, 2007), Bayesian logic programs (BLPs) (Kersting and De Raedt, 2001, 2008),…”
BackgroundInfluentialThe Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
Toward an architecture for never-ending language learning
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E., & Mitchell, T. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7519 · Cited by 2,000 · cited 1×
“More recently, the work on Never-Ending Language Learning (Nell) (Carlson et al, 2010) associates probabilities or confidences with instances of relations automatically extracted from the web, and the probabilistic logic programming system ProPPR (Wang et al, 2013) has been designed for reasoning…”
BackgroundFoundations of logic programming; (2nd extended ed.)
Lloyd, J. W. (1987) · Springer eBooks · Cited by 1,501
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
Cited by
Neural probabilistic logic programming in DeepProbLog
Manhaeve, R., Dumančić, S., Kimmig, A., Demeester, T., & De Raedt, L. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2021.103504 · Cited by 131
“Annotated disjunctions do not change the expressivity of ProbLog, as they can alternatively be modeled through independent facts and logical rules; we refer to De Raedt and Kimmig [6] for technical details.”
BackgroundMethodInfluentialSelf-citation(2019) · neural information processing systems · Cited by 104
Safe Reinforcement Learning via Probabilistic Logic Shields
Yang, W.-C., Marra, G., Rens, G., & De Raedt, L. (2023) · Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2023/637 · Cited by 34
A Critical Review of Inductive Logic Programming Techniques for Explainable AI
Zhang, Z., Yilmaz, L., & Liu, B. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3246980 · Cited by 25
“Dimension 2 (M)odel-based (P)roof-based M MLN, PRM [76] LTN, RNM P PLP [105], SLP [52] ∂ILP, DeepProbLog”
Background
Metadata
- Authors
- De Raedt, L., & Kimmig, A.
- Venue
- Machine Learning
- Published
- 2015-05-08
- Volume
- 100
- Issue
- 1
- Pages
- 5-47
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W811924890
- Cited by
- 189
- References
- 93
- FWCI
- 11.89
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Probabilistic (logic) programming concepts. https://app.cochat.ai/papers/10.1007/s10994-015-5494-z
- The paper
- De Raedt, L., & Kimmig, A. (2015). Probabilistic (logic) programming concepts. Machine Learning. https://doi.org/10.1007/s10994-015-5494-z
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.