I propose an amendment of Lewis's counterfactual analysis of causation, designed to overcome some difficulties concerning redundant causation.

According to James Woodward’s influential interventionist account of causation, X is a cause of Y iff, roughly, there is a possible intervention on X that changes Y. Woodward requires that interventions be merely logically possible. I will argue for two claims against this modal character of interventions: First, merely logically possible interventions are dispensable for the semantic project of providing an account of the meaning of causal statements. If interventions are indeed dispensable, the interventionist theory collapses into a counterfactual theory (...) of causation. Thus, the interventionist theory is not tenable as a theory of causation in its own right. Second, if one maintains that merely logically possible interventions are indispensable, then interventions with this modal character lead to the fatal result that interventionist counterfactuals are evaluated inadequately. Consequently, interventionists offer an inadequate theory of causation. I suggest that if we are concerned with explicating causal concepts and stating the truth-conditions of causal claims we best get rid of Woodwardian interventions. (shrink)

Chris Meek. Strong-Completeness and Faithfulness in Belief Networks.

We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relations are linear, but is otherwise completely general: It provides consistent estimates when the true causal structure contains feedback loops and latent variables, while the experiments can involve surgical or `soft' interventions on one or multiple variables at a time. The algorithm is `online' in the sense that it combines the results from (...) any set of available experiments, can incorporate background knowledge and resolves conflicts that arise from combining results from different experiments. In addition we provide a necessary and sufficient condition that determines when the algorithm can uniquely return the true graph, and can be used to select the next best experiment until this condition is satisfied. We demonstrate the method by applying it to simulated data and the flow cytometry data of Sachs et al. (shrink)