2020
DOI: 10.1609/aaai.v34i06.6577
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic Reasoning Across the Causal Hierarchy

Abstract: We propose a formalization of the three-tier causal hierarchy of association, intervention, and counterfactuals as a series of probabilistic logical languages. Our languages are of strictly increasing expressivity, the first capable of expressing quantitative probabilistic reasoning—including conditional independence and Bayesian inference—the second encoding do-calculus reasoning for causal effects, and the third capturing a fully expressive do-calculus for arbitrary counterfactual queries. We give a correspo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
20
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(21 citation statements)
references
References 94 publications
1
20
0
Order By: Relevance
“…Causal Team Semantics was proposed with the intention of supporting languages that discuss both accidental and causal dependencies. This is a topic that has gained quite some interest in recent years (see, e.g., [12,21]). Causal Team Semantics was developed along the lines of a non-modal tradition of logics of dependence and independence (e.g.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…Causal Team Semantics was proposed with the intention of supporting languages that discuss both accidental and causal dependencies. This is a topic that has gained quite some interest in recent years (see, e.g., [12,21]). Causal Team Semantics was developed along the lines of a non-modal tradition of logics of dependence and independence (e.g.…”
Section: Discussionmentioning
confidence: 99%
“…Then, while the fourth case in the second column takes K outside the scope of [ #-X= #x ], cases six through eight 'push' [γ ′ ] inside the formula until it has only an atom Z=z in front, at which moment [γ ′ ] is eliminated (fifth case). 21 The ninth case deals with nested announcements following an 'inside-first' strategy. 20 Recall that Z=z is the particular case of [ #-X= #x ]Z=z where #-X is empty.…”
Section: Proposition 3 (I) Every Formula φ ∈ L Pakc Is Logically Equivalent To a Formulamentioning
confidence: 99%
See 2 more Smart Citations
“…Even though the standard logical approach to causal reasoning (Pearl 2009;Halpern 2000Halpern , 2016 can model epistemic uncertainty 1 , it does not come with an object language that can make statements about the epistemic state of some agent. There are recent proposals adding probabilistic expressions to the object language (e.g., Ibeling and Icard 2020), but very little has been done on combining causal and qualitative epistemic reasoning. 2 However, this kind of reasoning occurs frequently in our daily life.…”
Section: Introductionmentioning
confidence: 99%