Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. definite clause programs containing probabilistic facts with a parameterized distribution. It extends the traditional least Herbrand model semantics in logic programming to distribution semantics, possible world semantics with a probability distribution which is unconditionally applicable to arbitrary logic programs including ones for HMMs, PCFGs and Bayesian networks. We also propose a new EM algorithm, the graphical EM algorithm, that runs for a class of parameterized logic programs representing sequential decision processes where each decision is exclusive and independent. It runs on a new data structure called support graphs describing the logical relationship between observations and their explanations, and learns parameters by computing inside and outside probability generalized for logic programs. The complexity analysis shows that when combined with OLDT search for all explanations for observations, the graphical EM algorithm, despite its generality, has the same time complexity as existing EM algorithms, i.e. the Baum-Welch algorithm for HMMs, the Inside-Outside algorithm for PCFGs, and the one for singly connected Bayesian networks that have been developed independently in each research field. Learning experiments with PCFGs using two corpora of moderate size indicate that the graphical EM algorithm can significantly outperform the Inside-Outside algorithm.
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 7×
“By the way, the Viterbi algorithm (Rabiner, 1989; Rabiner & Juang, 1993) provides for HMMs an e cient way of nding the most likely transition path for a given input/output string.”
BackgroundMethodInfluentialRUBIN, D. B. (1976) · Biometrika · doi:10.1093/biomet/63.3.581 · Cited by 9,925
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101
Cited by
BLOG: Probabilistic Models with Unknown Objects
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0015 · Cited by 390
Probabilistic Inductive Logic Programming
De Raedt, L., & Kersting, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78652-8_1 · Cited by 319
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
“Perhaps the simplest flavour of StarAI languages, and the one that directly builds upon logic programming and Prolog, is a family of languages based on distribution semantics (Sato, 1995; Sato & Kameya, 2001; De Raedt, Kimmig, & Toivonen, 2007).”
BackgroundInductive logic programming at 30
Cropper, A., Dumančić, S., Evans, R., & Muggleton, S. H. (2022) · Machine Learning · doi:10.1007/s10994-021-06089-1 · Cited by 61
Compressing probabilistic Prolog programs
De Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., & Toivonen, H. (2008) · Machine Learning · doi:10.1007/s10994-007-5030-x · Cited by 40
Metadata
- Authors
- Sato, T., & Kameya, Y.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2001-12-01
- Volume
- 15
- Pages
- 391-454
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2101335378
- Cited by
- 233
- References
- 3
- FWCI
- 3.76
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Parameter Learning of Logic Programs for Symbolic-Statistical Modeling. https://app.cochat.ai/papers/10.1613/jair.912
- The paper
- Sato, T., & Kameya, Y. (2001). Parameter Learning of Logic Programs for Symbolic-Statistical Modeling. Journal of Artificial Intelligence Research. https://doi.org/10.1613/jair.912
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.