The CONEstrip Algorithm

DOI10.1007/978-3-642-33042-1_6zbMath1336.68253OpenAlexW1578533321MaRDI QIDQ2805768

Erik Quaeghebeur

Publication date: 13 May 2016

Published in: Synergies of Soft Computing and Statistics for Intelligent Data Analysis (Search for Journal in Brave)

Full work available at URL: https://biblio.ugent.be/publication/3007274

zbMATH Keywords

linear programmingconsistencyconvex conesinferencefeasibility

Mathematics Subject Classification ID

Linear programming (90C05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (7)

Exposing some points of interest about non-exposed points of desirability ⋮ Conditioning, updating and lower probability zero ⋮ Evenly convex credal sets ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ A Propositional CONEstrip Algorithm ⋮ Accept \& reject statement-based uncertainty models ⋮ Probabilistic satisfiability and coherence checking through integer programming

Uses Software

• murasyp

Cites Work

• Unnamed Item
• Sets of desirable gambles: conditioning, representation, and precise probabilities
• Concave programming for minimizing the zero-norm over polyhedral sets
• How good are convex hull algorithms?
• Stochastic independence in a coherent setting
• Towards a unified theory of imprecise probability
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Accept \& reject statement-based uncertainty models
• Desirability
• Lectures on Polytopes

This page was built for publication: The CONEstrip Algorithm