Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Logic-based Tractable Approximation of Probability (2205.03198v1)

Published 6 May 2022 in cs.LO and cs.AI

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Paolo Baldi (12 papers)
  2. Hykel Hosni (6 papers)

Summary

We haven't generated a summary for this paper yet.