论文信息 - On the completeness of an identifiability algorithm for semi-Markovian models

On the completeness of an identifiability algorithm for semi-Markovian models

This journal issue, which pays tribute to the memory of Marco Somalvico, is part of a broader initiative, encompassing several journals, that each devoted to him a special issue. This is the result of a coordinated effort, and every different journal issue has its own specific profile. The issue of Annals of Mathematics and Artificial Intelligence you are holding only includes three articles, but they are dense, and provide an indepth treatment of their respective subjects. Yimin Huang and Marco Valtorta develop the mathematics of an identifiability problem in causal Bayesian networks. A causal Bayesian network consists of a causal

Marco Colombetti | Ephraim Nissan | Giuseppina C. Gini | M. Valtorta | Yimin Huang

[1] J. Pearl. Causality: Models, Reasoning and Inference , 2000 .

[2] James M. Robins,et al. Probabilistic evaluation of sequential plans from causal models with hidden variables , 1995, UAI.

[3] Judea Pearl,et al. Testing Identifiability of Causal Effects , 1995, UAI.

[4] James M. Robins,et al. Causal Inference from Complex Longitudinal Data , 1997 .

[5] Steffen L. Lauritzen,et al. Causal Inference from Graphical Models , 2001 .

[6] Jin Tian,et al. On the Testable Implications of Causal Models with Hidden Variables , 2002, UAI.

[7] Joel Waldfogel,et al. Introduction , 2010, Inf. Econ. Policy.

[8] J. Pearl. Causal diagrams for empirical research , 1995 .

[9] Jin Tian,et al. A general identification condition for causal effects , 2002, AAAI/IAAI.

[10] Manabu Kuroki,et al. IDENTIFIABILITY CRITERIA FOR CAUSAL EFFECTS OF JOINT INTERVENTIONS , 1999 .

[11] Jin Tian,et al. Identifying Conditional Causal Effects , 2004, UAI.