The PC Algorithm and the Inference to Constitution

Gebharter has proposed using one of the best known Bayesian network causal discovery algorithms, PC, to identify the constitutive dependencies underwriting mechanistic explanations. His proposal assumes that mechanistic constitution behaves like deterministic direct causation, such that PC is directly applicable to mixed variable sets featuring both causal and constitutive dependencies. Gebharter claims that such mixed sets, under certain restrictions, comply with PC's background assumptions. The aim of this article is to show that Gebharter's proposal incurs severe problems, ultimately rooted in the widespread non-compliance of mechanistic systems with PC's assumptions. This casts severe doubts on the attempt to implicitly define constitution as a form of deterministic direct causation complying with PC's assumptions.