A note on the complexity of the causal ordering problem

作者：Bernardo Gonalves; Fabio Porto

来源：Artificial Intelligence, 2016, 238: 154-165.

DOI：10.1016/j.artint.2016.06.004

• Causal ordering
• Causal reasoning
• Structural equations
• Hypothesis management

Abstract(#br)In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical algorithm to infer causal ordering is NP-Hard—an in...

• 出版日期2016
• 单位IBM