Computing lower and upper expectations under epistemic independence
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3720156 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3635280 (Why is no real title available?)
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- A Branch-and-Bound Method for Reversed Geometric Programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Causation, prediction, and search
- Convex analysis and global optimization
- Credal networks
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- Epistemic independence for imprecise probabilities
- Epistemic irrelevance on sets of desirable gambles
- Graphical models for imprecise probabilities
- Graphoid properties of epistemic irrelevance and independence
- Identifying independence in bayesian networks
- Prediction of oligopeptide conformations via deterministic global optimization
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
- Semigraphoids and structures of probabilistic conditional independence
- Stochastic independence in a coherent setting
- Strong conditional independence for credal sets
- The L-separation criterion for description of cs-independence models
Cited in
(20)- Probabilistic logic with independence
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Computing posterior upper expectations
- Compositional models and conditional independence in evidence theory
- Generalizing inference rules in a coherence-based probabilistic default reasoning
- Sets of probability distributions, independence, and convexity
- Computing Bounds on Expectations
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Independent products in infinite spaces
- Independent natural extension
- Logics in Artificial Intelligence
- Statistical matching of multiple sources: A look through coherence
- Empirical comparison of methods for the hierarchical propagation of hybrid uncertainty in risk assessment, in presence of dependences
- Probabilistic abduction without priors
- Independence and 2-monotonicity: nice to have, hard to keep
- Independence and 2-monotonicity: nice to have, hard to keep
- Thirty years of credal networks: specification, algorithms and complexity
- Modelling epistemic irrelevance with choice functions
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- Credal networks under epistemic irrelevance
This page was built for publication: Computing lower and upper expectations under epistemic independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q881798)
