1 citations · 2 across the 6 of their papers we have counts for
Showing 2023 · cs.AIShow all
2 papers · 2 filters
cs.AI2023★ 1 cited
Tractable Bounding of Counterfactual Queries by Knowledge Compilation
David Huber, Yizuo Chen, Alessandro Antonucci +2
We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an i…
cs.AI2023
Efficient Computation of Counterfactual Bounds
Marco Zaffalon, Alessandro Antonucci, Rafael Cabañas +2
We assume to be given structural equations over discrete variables inducing a directed acyclic graph, namely, a structural causal model, together with data about its internal nodes…