A logic-based tractable approximation of probability

DOI10.1093/LOGCOM/EXAC038MaRDI QIDQ6042096zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 16 May 2023

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2205.03198

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Abstract: We provide a logical framework in which a resource-bounded agent can be seen to perform approximations of probabilistic reasoning. Our main results read as follows. First we identify the conditions under which propositional probability functions can be approximated by a hierarchy of depth-bounded Belief functions. Second we show that under rather palatable restrictions, our approximations of probability lead to uncertain reasoning which, under the usual assumptions in the field, qualifies as tractable.

Recommendations

• Depth-Bounded Approximations of Probability
• Tractable reasoning via approximation
• On the hardness of approximate reasoning
• The universe of approximations
• Tractable depth-bounded logics and the problem of logical omniscience

Cited in

(5)

• Empirical progress and truth approximation by the `hypothetico-probabilistic method'
• On the logical consistency of probabilistic predictions
• scientific article; zbMATH DE number 3321248 (Why is no real title available?)
• Logical perspectives on the foundations of probability
• A probabilistic logic based on the acceptability of gambles

This page was built for publication: A logic-based tractable approximation of probability

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