Computing lower and upper expectations under epistemic independence

DOI10.1016/j.ijar.2006.07.013zbMath1116.68102OpenAlexW2110864884MaRDI QIDQ881798

Fabio Gagliardi Cozman, Cassio Polpo de Campos

Publication date: 18 May 2007

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://pureadmin.qub.ac.uk/ws/files/29752576/decampos2007a.pdf

zbMATH Keywords

imprecise probabilitiesepistemic independencesets of probability measuresmultilinear programmingconcepts of independence

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (14)

Probabilistic logic with independence ⋮ Statistical matching of multiple sources: A look through coherence ⋮ Credal networks under epistemic irrelevance ⋮ Sets of probability distributions, independence, and convexity ⋮ Epistemic irrelevance in credal nets: the case of imprecise Markov trees ⋮ Generalizing inference rules in a coherence-based probabilistic default reasoning ⋮ Modelling epistemic irrelevance with choice functions ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Independent natural extension ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ Independent products in infinite spaces ⋮ EMPIRICAL COMPARISON OF METHODS FOR THE HIERARCHICAL PROPAGATION OF HYBRID UNCERTAINTY IN RISK ASSESSMENT, IN PRESENCE OF DEPENDENCES ⋮ Compositional models and conditional independence in evidence theory ⋮ Probabilistic abduction without priors

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphoid properties of epistemic irrelevance and independence
• Epistemic irrelevance on sets of desirable gambles
• Causation, prediction, and search
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Semigraphoids and structures of probabilistic conditional independence
• Prediction of oligopeptide conformations via deterministic global optimization
• Credal networks
• Stochastic independence in a coherent setting
• Strong conditional independence for credal sets
• The L-separation criterion for description of cs-independence models
• Epistemic independence for imprecise probabilities
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• An axiomatic framework for propagating uncertainty in directed acyclic networks
• Graphical models for imprecise probabilities
• A Branch-and-Bound Method for Reversed Geometric Programming
• Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
• Identifying independence in bayesian networks
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Convex analysis and global optimization

This page was built for publication: Computing lower and upper expectations under epistemic independence