Probabilistic abduction without priors

DOI10.1016/J.IJAR.2007.05.012zbMATH Open1184.68506OpenAlexW2126500222MaRDI QIDQ2270396FDOQ2270396

Authors: Angelo Gilio, Gabriele Kern-Isberner, Didier Dubois 

Publication date: 18 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.ijar.2007.05.012

Recommendations

• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• scientific article; zbMATH DE number 1568689
• Probabilistic Horn abduction and Bayesian networks
• Abductive logics in a belief revision framework
• scientific article; zbMATH DE number 4001202

zbMATH Keywords

entropycoherencemaximum likelihoodShapley valueimprecise probabilityprior probabilityBayes theorem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Default reasoning and possibility theory
• The transferable belief model
• Stochastic independence in a coherent setting
• Cores of convex games
• Characterization of coherent conditional probabilities as a tool for their assessment and extension
• Coherent numerical and ordinal probabilistic assessments
• Title not available (Why is that?)
• Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
• A semantics for possibility theory based on likelihoods
• Title not available (Why is that?)
• The Uncertain Reasoner's Companion
• Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
• Belief revision and information fusion on optimum entropy
• Probabilistic satisfiability with imprecise probabilities
• Title not available (Why is that?)
• Direct algorithms for checking consistency and making inferences from conditional probability assessments
• Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents
• Probabilistic logic under coherence: complexity and algorithms
• Computing lower and upper expectations under epistemic independence
• An introduction to the imprecise Dirichlet model for multinomial data
• On the linear structure of betting criterion and the checking of coherence
• A generalization of the fundamental theorem of de Finetti for imprecise conditional probability assessments
• Conditional objects as nonmonotonic consequence relationships
• Title not available (Why is that?)
• Decision making under incomplete data using the imprecise Dirichlet model
• Title not available (Why is that?)
• Computing posterior upper expectations
• Algorithms for imprecise probabilities
• Title not available (Why is that?)

Cited In (7)

• Imprecise probabilities for representing ignorance about a parameter
• Generalizing inference rules in a coherence-based probabilistic default reasoning
• Probabilities of conditionals and previsions of iterated conditionals
• When no reason for is a reason against
• On various ways of tackling incomplete information in statistics
• Statistical matching of multiple sources: A look through coherence
• A min-max regret approach to maximum likelihood inference under incomplete data

This page was built for publication: Probabilistic abduction without priors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270396)