The CONEstrip algorithm
From MaRDI portal
Publication:2805768
Recommendations
- A propositional CONEstrip algorithm
- Characterizing coherence, correcting incoherence
- Notes on desirability and conditional lower previsions
- Constrained optimization problems under uncertainty with coherent lower previsions
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
Cites work
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- Accept \& reject statement-based uncertainty models
- Concave programming for minimizing the zero-norm over polyhedral sets
- Desirability
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- How good are convex hull algorithms?
- Lectures on Polytopes
- Sets of desirable gambles: conditioning, representation, and precise probabilities
- Stochastic independence in a coherent setting
- Towards a unified theory of imprecise probability
Cited in
(9)- Playing with sets of lexicographic probabilities and sets of desirable gambles
- Evenly convex credal sets
- Probabilistic satisfiability and coherence checking through integer programming
- Exposing some points of interest about non-exposed points of desirability
- Algorithm 942
- A propositional CONEstrip algorithm
- Accept \& reject statement-based uncertainty models
- Conditioning, updating and lower probability zero
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
This page was built for publication: The CONEstrip algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805768)
