Complexity results for structure-based causality.
From MaRDI portal
(Redirected from Publication:1852862)
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 1467490 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- A logic for reasoning about probabilities
- A logic of universal causation
- Axioms of causal relevance
- Causes and Explanations: A Structural-Model Approach. Part I: Causes
- Causes and Explanations: A Structural-Model Approach. Part II: Explanations
- Causes and explanations in the structural-model approach: Tractable cases
- Complexity classes defined by counting quantifiers
- Computational Complexity of Probabilistic Turing Machines
- Finding MAPs for belief networks is NP-hard
- More complicated questions about maxima and minima, and some closures of NP
- On the hardness of approximate reasoning
- On the power of deterministic reductions to C=P
- PP is closed under intersection
- Probabilistic Evaluation of Counterfactual Queries
- Probabilistic logic programming with conditional constraints
- Provably correct theories of action
- SATO: An efficient propositional prover
- The complexity of combinatorial problems with succinct input representation
- The computational complexity of probabilistic inference using Bayesian belief networks
Cited in
(35)- IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING?
- Appropriate causal models and the stability of causation
- Foundations of fine-grained explainability
- A complexity assessment for queries involving sufficient and necessary causes
- Explanation in artificial intelligence: insights from the social sciences
- Causal computational complexity of distributed processes
- On probability-raising causality in Markov decision processes
- Efficient computation of counterfactual bounds
- Foundations of probability-raising causality in Markov decision processes
- The parameterized complexity and kernelization of resilience for database queries
- A theory of fine-grained lineage for functions on structured objects
- Path-specific effects
- The computational complexity of structure-based causality
- Causes and explanations in the structural-model approach: Tractable cases
- Identification of structures and causation in flow graphs
- Complete identification methods for the causal hierarchy
- A note on the complexity of the causal ordering problem
- Counterfactuals modulo temporal logics
- Actual causality
- Explaining counterexamples using causality
- On computations with causal compositional models.
- A stratification of possibilistic partial explanations
- Operational causality -- necessarily sufficient and sufficiently necessary
- The resilience of conjunctive queries with inequalities
- From Checking to Inference: Actual Causality Computations as Optimization Problems
- Causality checking for complex system models
- scientific article; zbMATH DE number 3938415 (Why is no real title available?)
- Uncovering deterministic causal structures: a Boolean approach
- A note on the correctness of the causal ordering algorithm
- Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations
- scientific article; zbMATH DE number 1467490 (Why is no real title available?)
- Computational complexity of determining which statements about causality hold in different space-time models
- Complexity results for explanations in the structural-model approach
- Actual causation and the art of modeling
- A formalization of Heisenbugs and their causes
This page was built for publication: Complexity results for structure-based causality.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1852862)
