IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?

DOI10.1017/s1755020322000211arXiv2111.13936OpenAlexW3217313098MaRDI QIDQ6131225

Thomas F. III Icard, Unnamed Author, Unnamed Author

Publication date: 4 April 2024

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.13936

zbMATH Keywords

complexityprobabilitycausationlogicETR

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Philosophical and critical aspects of logic and foundations (03A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey of polynomial transformations between NP-complete problems
• The complexity of reasoning about knowledge and time. I: Lower bounds
• When are probabilistic explanations possible?
• Frequentist probability and frequentist statistics
• Decidability and expressiveness for first-order logics of probability
• A logic for reasoning about probabilities
• Complexity results for structure-based causality.
• Dynamic interactive epistemology
• Absolutely no free lunches!
• On the hardness of approximate reasoning
• Probability Logics
• Thirty Essays on Geometric Graph Theory
• The Computational Complexity of Structure-Based Causality
• Complexity of Some Geometric and Topological Problems
• Probabilistic Inference and Influence Diagrams
• Causal diagrams for empirical research
• Controversies in the Foundations of Statistics
• Quantifying over events in probability logic: an introduction
• Philosophy and the practice of Bayesian statistics
• The art gallery problem is ∃ ℝ-complete
• Understanding Machine Learning
• On the Numerical Representation of Qualitative Conditional Probability
• The complexity of theorem-proving procedures
• On Pearl’s Hierarchy and the Foundations of Causal Inference
• Probability logic for type spaces

This page was built for publication: IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?