Cited by 23

BLOG: Probabilistic Models with Unknown Objects

Milch, Brian, Marthi, Bhaskara, Russell, Stuart, Sontag, David, Ong, Daniel L., Kolobov, Andrey·2007·Introduction to Statistical Relational Learning

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.7551/mitpress/7432.003.0015

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • For AI systems, probabilistic programs have been shown to be a promising formalism for world modeling.

    “For AI systems, probabilistic programs have been shown to be a promising formalism for world modeling (e.g., Milch et al., 2007;Matheos et al., 2020;Gothoskar et al., 2021;Fremont et al., 2022).”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D.L., Kolobov, A.: BLOG: Prob- abilistic models with unknown objects. In: Proc. 19th International Joint Conf. on AI. (2005) To appear.
  2. Milch, B., Marthi, B., Sontag, D., Russell, S., Ong, D.L., Kolobov, A.: Approximate inference for infinite contingent Bayesian networks. In: 10th International Workshop on AI and Statistics. (2005)
  3. Koller, D., Pfeffer, A.: Probabilistic frame-based systems. In: Proc. 15th National Conf. on AI. (1998) 580-587
  4. Getoor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of relational structure. In: Proc. 18th International Conf. on Machine Learning. (2001) 170-177
  5. Pasula, H., Marthi, B., Milch, B., Russell, S., Shpitser, I.: Identity uncertainty and citation matching. In: Advances in Neural Information Processing Systems 15. MIT Press, Cambridge, MA (2003)

Cited by

Sorted by citations

Authors
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A.
Venue
Introduction to Statistical Relational Learning
Publisher
The MIT Press
Published
2007-08-31
Pages
373-398
Cited by
23
References
1
Language
en

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