A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
From MaRDI portal
Publication:1605690
DOI10.1016/S0888-613X(00)00038-4zbMath0995.68124MaRDI QIDQ1605690
Publication date: 23 July 2002
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Probability and inductive logic (03B48) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (26)
Probabilistic logic under coherence: complexity and algorithms ⋮ Transitive Reasoning with Imprecise Probabilities ⋮ Incoherence correction strategies in statistical matching ⋮ Transitivity in coherence-based probability logic ⋮ Approximate algorithms for credal networks with binary variables ⋮ Interpreting connexive principles in coherence-based probability logic ⋮ Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation ⋮ Probabilistic squares and hexagons of opposition under coherence ⋮ Probabilities of conditionals and previsions of iterated conditionals ⋮ On conditional probabilities and their canonical extensions to Boolean algebras of compound conditionals ⋮ Connexive logic, probabilistic default reasoning, and compound conditionals ⋮ Imprecise probabilistic models based on hierarchical intervals ⋮ Generalizing inference rules in a coherence-based probabilistic default reasoning ⋮ Characterizing coherence, correcting incoherence ⋮ Weak nonmonotonic probabilistic logics ⋮ Quasi conjunction, quasi disjunction, t-norms and t-conorms: probabilistic aspects ⋮ Aggregating disparate estimates of chance ⋮ Probabilistic abduction without priors ⋮ Reasoning about uncertain conditionals ⋮ Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP ⋮ Unnamed Item ⋮ Predictive distributions that mimic frequencies over a restricted subdomain ⋮ Probabilistic logic under coherence, conditional interpretations, and default reasoning ⋮ Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding ⋮ Probabilistic satisfiability and coherence checking through integer programming ⋮ A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notes on conditional previsions
- Probabilistic logic
- Anytime deduction for probabilistic logic
- Simplification rules for the coherent probability assessment problem
- A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
- Coherence checking and propagation of lower probability bounds
- A logic for reasoning about probabilities
- Direct algorithms for checking consistency and making inferences from conditional probability assessments
- CHARACTERIZATION OF COHERENT CONDITIONAL PROBABILITIES AS A TOOL FOR THEIR ASSESSMENT AND EXTENSION
- On confirmation and rational betting
- Finitely additive conditional probabilities
- Column Generation Methods for Probabilistic Logic
- SUBJECTIVE PROBABILITY VERSUS BELIEF FUNCTIONS IN ARTIFICIAL INTELLIGENCE
- Programming with linear fractional functionals
- Conditional events in probability assessment and revision
- Coherent numerical and ordinal probabilistic assessments
This page was built for publication: A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
