Direct algorithms for checking consistency and making inferences from conditional probability assessments

DOI10.1016/j.jspi.2003.09.005zbMath1075.62002OpenAlexW2055926425MaRDI QIDQ1888857

Renato Pelessoni, Peter Walley, Paolo Vicig

Publication date: 29 November 2004

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2003.09.005

zbMATH Keywords

Bayesian inference Natural extension Probabilistic reasoning Probabilistic logic Avoiding uniform loss Coherent probabilities Fundamental theorem of probability Imprecise probability Lower probability

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Applications of mathematical programming (90C90) Linear programming (90C05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Axioms; other general questions in probability (60A05)

Related Items

Graphoid properties of epistemic irrelevance and independence, Probabilistic logic under coherence: complexity and algorithms, Coherence graphs, Direct algorithms for checking consistency and making inferences from conditional probability assessments, Transitive Reasoning with Imprecise Probabilities, Transitivity in coherence-based probability logic, Probabilistic logic with independence, Financial risk measurement with imprecise probabilities, Interpreting connexive principles in coherence-based probability logic, Conformity and independence with coherent lower previsions, Benefits of embedding structural constraints in coherent diagnostic processes, Uncertainty modelling and conditioning with convex imprecise previsions, Imprecise probability trees: bridging two theories of imprecise probability, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, Computing lower and upper expectations under epistemic independence, Probabilistic squares and hexagons of opposition under coherence, Connexive logic, probabilistic default reasoning, and compound conditionals, Conditioning, updating and lower probability zero, Imprecise probabilistic models based on hierarchical intervals, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Bayes theorem bounds for convex lower previsions, Generalizing inference rules in a coherence-based probabilistic default reasoning, Notes on desirability and conditional lower previsions, Sets of desirable gambles: conditioning, representation, and precise probabilities, Independent natural extension, Robust optimization approximation for ambiguous P-model and its application, Improved linear programming methods for checking avoiding sure loss, Sum-of-squares for bounded rationality, Characterizing coherence, correcting incoherence, Quantitative Logic Reasoning, Envelopes of conditional probabilities extending a strategy and a prior probability, Compatibility, desirability, and the running intersection property, Williams coherence and beyond, Finite approximations of data-based decision problems under imprecise probabilities, Conditional models: coherence and inference through sequences of joint mass functions, Merging the local and global approaches to probabilistic satisfiability, Probabilistic abduction without priors, A survey of the theory of coherent lower previsions, The CONEstrip Algorithm, Inference with nearly-linear uncertainty models, A Propositional CONEstrip Algorithm, Updating coherent previsions on finite spaces, Probabilistic satisfiability and coherence checking through integer programming, Towards a unified theory of imprecise probability, A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments, Conglomerable coherence, Quasi-Bayesian analysis using imprecise probability assessments and the generalized Bayes' rule

Cites Work