The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Lifted First-Order Probabilistic Inference
Abstract
Most probabilistic inference algorithms are specified and processed on a propositional level. In the last decade, many proposals for algorithms accepting first-order specifications have been presented, but in the inference stage they still operate on a mostly propositional representation level. [Poole, 2003] presented a method to perform inference directly on the first-order level, but this method is limited to special cases. In this paper we present the first exact inference algorithm that operates directly on a first-order level, and that can be applied to any first-order model (specified in a language that generalizes undirected graphical models). Our experiments show superior performance in comparison with propositional exact inference. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1988) · Cited by 16,582
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
Learning Probabilistic Relational Models
Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_13 · Cited by 933
An analysis of first-order logics of probability
Halpern, J. Y. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90019-v · Cited by 585
Probabilistic Horn abduction and Bayesian networks
Poole, D. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90061-f · Cited by 576
First-order probabilistic inference
Poole, D. (2003) · Cited by 412
A simple approach to Bayesian network computations
Zhang, N. L., & Poole, D. (1994) · Cited by 330
Probabilistic logic programming
Ng, R. T., & Subrahmanian, V. S. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90061-j · Cited by 317
Kersting, K., & Raedt, L. D. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0111058 · Cited by 166
Cited by
Introduction to Statistical Relational Learning
(2007) · doi:10.7551/mitpress/7432.001.0001 · Cited by 1,643
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
Markov Logic: An Interface Layer for Artificial Intelligence
Domingos, P., & Lowd, D. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00206ed1v01y200907aim007 · Cited by 314
Survey on Models and Techniques for Root-Cause Analysis
Solé, M., Muntés-Mulero, V., Rana, A. I., & Estrada, G. (2017) · arXiv · doi:10.48550/arxiv.1701.08546 · Cited by 74
Metadata
- Authors
- de Salvo Braz, R., Amir, E., & Roth, D.
- Venue
- Introduction to Statistical Relational Learning
- Publisher
- The MIT Press
- Published
- 2007-08-31
- Pages
- 433-452
- OpenAlex
- W2107272354
- Cited by
- 272
- References
- 18
- FWCI
- 26.96
- Type
- book chapter
- Language
- en
- Open access
- closed
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: Lifted First-Order Probabilistic Inference. https://app.cochat.ai/papers/10.7551/mitpress/7432.003.0017
- The paper
- de Salvo Braz, R., Amir, E., & Roth, D. (2007). Lifted First-Order Probabilistic Inference. Introduction to Statistical Relational Learning. https://doi.org/10.7551/mitpress/7432.003.0017
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.