Cited by 196Advanced Causal Inference TechniquesBayesian Modeling and Causal InferencePhilosophy of Biology and Scientific Explanation

The DOI matches its Crossref record; 47 of the 51 references it cites were found in a registry or an index, and 4 are not checked yet.

Probabilities of causation: Bounds and identification

Open access
Tian, Jin, Pearl, Judea·2000·Annals of Mathematics and Artificial Intelligence

Overview

Integrity signals

Registry

Crossref · 10.1023/a:1018912507879

Cites

47 of 51 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • The expression in (54) provides a lower bound for PN in the general, nonmonotonic case.

    “It can also be shown (Tian and Pearl, 2000) that the expression in (54) provides a lower bound for PN in the general, nonmonotonic case.”

    From Causal inference in statistics: An overview (2009) · cites this paper as Tian and Pearl, 2000

  • The tight upper and lower bounds on PN are given by Eq. (55).

    “In particular, the tight upper and lower bounds on PN are given by:”

    From Causal inference in statistics: An overview (2009) · cites this paper as Tian and Pearl, 2000

  • The algebraic machinery of counterfactual notation can be powerful in refining assumptions, deriving consistent estimands, bounding probabilities of necessary and sufficient causation, and combining experimental and nonexperimental data.

    “the algebraic machinery offered by the counterfactual notation, Y x (u), once a problem is properly formalized, can be extremely powerful in refining assumptions (Angrist et al., 1996, Heckman andVytlacil, 2005), deriving consistent estimands (Robins, 1986), bounding probabilities of necessary and sufficient causation (Tian and Pearl, 2000), and combining data from experimental and nonexperimental”

    From An Introduction to Causal Inference (2010) · cites this paper as Tian and Pearl, 2000

  • The tight upper and lower bounds on PN are given by max(0, (P(y)-P(y|do(x0)))/P(x,y)) ≤ PN ≤ min(1, (P(y|do(x1))-P(x1,y))/P(x,y)).

    “In particular, the tight upper and lower bounds on PN are given by: max 0, P(y)-P(y|do(x )) P(x,y) ≤PN ≤min 1, P(y |do(x ))-P(x ,y ) P(x,y)”

    From An Introduction to Causal Inference (2010) · cites this paper as Tian and Pearl, 2000

  • The expression in (61) provides a lower bound for PN in the general, nonmonotonic case.

    “It can also be shown (Tian and Pearl, 2000) that the expression in (61) provides a lower bound for PN in the general, nonmonotonic case.”

    From An Introduction to Causal Inference (2010) · cites this paper as Tian and Pearl, 2000

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 8

  1. A. Balke, Probabilistic counterfactuals: Semantics, computation, and applications, Ph.D. thesis, Computer Science Department, University of California, Los Angeles, CA (November 1995).
  2. P. Cole, Causality in epidemiology, health policy, and law, Journal of Marketing Research 27 (1997) 10279-10285.
  3. P.J. Dhrymes, Econometrics (Springer, New York, 1970).
  4. N. Hall, Two concepts of causation (1998) in press.
  5. D. Lewis, Philosophical Papers (Oxford University Press, New York, 1986).
  6. J. Marschak, Statistical inference in economics, in: Statistical Inference in Dynamic Economic Models, ed. T. Koopmans (Wiley, New York, 1950) pp. 1-50. Cowles Commission for Research in Economics, Monograph 10.
  7. J.S. Mill, System of Logic, Vol. 1 (John W. Parker, London, 1843).
  8. D.W. Robertson, The common sense of cause in fact, Texas Law Review 75(7) (1997) 1765-1800.

Cited by

Sorted by citations

Metadata

Authors
Tian, J., & Pearl, J.
Affiliations
University of California, Los Angeles (US)
Venue
Annals of Mathematics and Artificial Intelligence
Published
2000-10
Volume
28
Issue
1-4
Pages
287-313
ISSN
  • 1012-2443 (ISSN-L)
  • 1573-7470
OpenAlex
W1498383682
Cited by
179
References
50
Citations by year
2026: 12 · 2025: 18 · 2024: 18 · 2023: 18 · 2022: 18 · 2021: 15 · 2020: 6 · 2019: 10 · 2018: 4 · 2017: 4 · 2016: 8 · 2015: 3 · 2014: 8 · 2013: 7 · 2012: 3
FWCI
1.66
Type
journal article
Language
en
Open access
Locations
  • Annals of Mathematics and Artificial Intelligence (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • eScholarship (California Digital Library) (submittedVersion)
  • arXiv (Cornell University)
  • Department of Statistics, UCLA
Funders
  • National Science Foundation
  • Office of Naval Research
  • Air Force Office of Scientific Research
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Advanced Causal Inference Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
  • Social Sciences › Arts and Humanities › History and Philosophy of Science › Philosophy of Biology and Scientific Explanation
Keywords
probability of causation, sharp bounds, causal inference, exogeneity, monotonicity, attribution, structural causal models

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