mlsanityData to 14 Oct 2026

Structural Causal Models Are (Solvable by) Credal Networks

arXiv 2008.00463 ↗First posted 2 Aug 2020cs.AIcited by 22

Not on the map. Why?

Abstract (arXiv)

A structural causal model is made of endogenous (manifest) and exogenous (latent) variables. We show that endogenous observations induce linear constraints on the probabilities of the exogenous variables. This allows to exactly map a causal model into a credal network. Causal inferences, such as interventions and counterfactuals, can consequently be obtained by standard algorithms for the updating of credal nets. These natively return sharp values in the identifiable case, while intervals corresponding to the exact bounds are produced for unidentifiable queries. A characterization of the causal models that allow the map above to be compactly derived is given, along with a discussion about the scalability for general models. This contribution should be regarded as a systematic approach to represent structural causal models by credal networks and hence to systematically compute causal inferences. A number of demonstrative examples is presented to clarify our methodology. Extensive experiments show that approximate algorithms for credal networks can immediately be used to do causal inference in real-size problems.

Key facts. Cited by 22 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 4; 2023: 5; 2024: 2; 2025: 5; 2026: 4.

22 papers.

Sort:

  1. 2021Partial Counterfactual Identification from Observational and Experimental Datacited by 64
  2. 2023Sharp Bounds for Generalized Causal Sensitivity Analysiscited by 24
  3. 2025Causally Reliable Concept Bottleneck Modelscited by 17
  4. 2023Partial Counterfactual Identification of Continuous Outcomes with a Curvature Sensitivity Modelcited by 14
  5. 2023Approximating Counterfactual Bounds while Fusing Observational, Biased and Randomised Data Sourcescited by 9
  6. 2023Efficient Computation of Counterfactual Boundscited by 8
  7. 2024Learning Structural Causal Models through Deep Generative Models: Methods, Guarantees, and Challengescited by 8
  8. 2022On the Complexity of Counterfactual Reasoningcited by 7
  9. 2022Bounding Counterfactuals under Selection Biascited by 6
  10. 2025Robust Counterfactual Inference in Markov Decision Processescited by 3
  11. 2023Tractable Bounding of Counterfactual Queries by Knowledge Compilationcited by 2
  12. 2025Multilinear and Linear Programs for Partially Identifiable Queries in Quasi-Markovian Structural Causal Modelscited by 2
10 more
  1. 2021CREPO: An Open Repository to Benchmark Credal Network Algorithmscited by 1
  2. 2022Robustness Guarantees for Credal Bayesian Networks via Constraint Relaxation over Probabilistic Circuitscited by 1
  3. 2024Bayesian Networks for Causal Analysis in Socioecological Systemscited by 1
  4. 2025Causal computations in Semi Markovian Structural Causal Models using divide and conquercited by 1
  5. 2026Bounds and Identification of Joint Probabilities of Potential Outcomes and Observed Variables under Monotonicity Assumptionscited by 1
  6. 2022Learning to Bound Counterfactual Inference from Observational, Biased and Randomised Datacited by 0
  7. 2025A Framework for Causal Concept-based Model Explanationscited by 0
  8. 2026On the Relationship between Bayesian Networks and Probabilistic Structural Causal Modelscited by 0
  9. 2026Optimal Experiments for Partial Causal Effect Identificationcited by 0
  10. 2026Identification and Bounding of Central Moments of Causal Effects Using Marginal Moments Informationcited by 0