Probabilistic and causal satisfiability: constraining the model
From MaRDI portal
Cites work
- A logic for reasoning about probabilities
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Causal diagrams for empirical research
- Causality. Models, reasoning, and inference
- Complete identification methods for the causal hierarchy
- Complexity of some geometric and topological problems
- Complexity results for classes of quantificational formulas
- Computational Complexity
- scientific article; zbMATH DE number 2243356 (Why is no real title available?)
- NEXP-completeness and universal hardness results for justification logic
- On Pearl’s Hierarchy and the Foundations of Causal Inference
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the hardness of approximate reasoning
- Probabilistic graphical models.
- Probabilistic logic
- Probing the Quantitative-Qualitative Divide in Probabilistic Reasoning
- Smoothing the Gap Between NP and ER
- Solving systems of polynomial inequalities in subexponential time
- The book of why. The new science of cause and effect
- The computational complexity of probabilistic inference using Bayesian belief networks
- The existential theory of the reals with summation operators
This page was built for publication: Probabilistic and causal satisfiability: constraining the model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397603)
