Divide and conquer for causal computation

DOI10.1016/J.IJAR.2025.109520MaRDI QIDQ6883175zbMATH OpenFDO

Authors Anna Rodum Bjøru, Rafael Cabañas, Helge Langseth, Antonio Salmerón

Publication date 16 December 2025

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IJAR.2025.109520

zbMATH Keywords

causalitycounterfactual reasoningheuristic searchsatisfiabilitystructural causal models

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites work

• A General Method for Deriving Tight Symbolic Bounds on Causal Effects
• Causality. Models, reasoning, and inference
• Credal networks
• Efficient computation of counterfactual bounds
• On Pearl’s Hierarchy and the Foundations of Causal Inference
• Probabilistic graphical models.

Cited in

(1)

• Special issue on the twelfth international conference on probabilistic graphical models (PGM 2024)

This page was built for publication: Divide and conquer for causal computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883175)