A logic-based tractable approximation of probability
From MaRDI portal
Publication:6042096
DOI10.1093/LOGCOM/EXAC038arXiv2205.03198OpenAlexW4285123650WikidataQ114091816 ScholiaQ114091816MaRDI QIDQ6042096
Author name not available (Why is that?)
Publication date: 16 May 2023
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2205.03198
Related Items (5)
On the logical consistency of probabilistic predictions ⋮ A probabilistic logic based on the acceptability of gambles ⋮ Logical perspectives on the foundations of probability ⋮ Title not available (Why is that?) ⋮ Empirical progress and truth approximation by the `hypothetico-probabilistic method'
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)
