Probabilistic abduction without priors

DOI10.1016/J.IJAR.2007.05.012MaRDI QIDQ2270396zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

entropycoherencemaximum likelihoodShapley valueimprecise probabilityprior probabilityBayes theorem

Mathematics Subject Classification ID

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

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

Cites work

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

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
• On various ways of tackling incomplete information in statistics
• When no reason for is a reason against
• 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)