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
Probability can be viewed as a multi-valued logic that extends binary Boolean propositional logic t...
Steffen Michels Hybrid Probabilistic Logics: Theoretical Aspects, Algorithms and Experiments Probabi...
Moss (2018) argues that rational agents are best thought of not as having degrees of belief in vario...
We propose a general scheme for adding probabilistic reasoning capabilities to any knowledge represe...
Uncertain knowledge can be modeled by using graded probabilities rather than binary truth-values, bu...
AbstractWe offer a view on how probability is related to logic. Specifically, we argue against the w...
A central goal of AI is to reason efficiently in domains that are both complex and uncertain. Most a...
Automated reasoning about uncertain knowledge has many applications. One difficulty when developing ...
Probabilistic Reasoning in Intelligent Systems is a complete and accessible account of the theoretic...
This paper introduces and investigates Depth-bounded Belief functions, a logic-based representation ...
AbstractWe show that the principle of maximum U-uncertainty for ampliative possibilistic reasoning c...
AbstractWe consider a language for reasoning about probability which allows us to make statements su...
We propose a new model for forming and revising beliefs about unknown probabilities. To go beyond wh...
AbstractProbability is usually closely related to Boolean structures, i.e., Boolean algebras or prop...
In multi-agent systems, the knowledge of agents about other agents??? knowledge often plays a pivota...
Probability can be viewed as a multi-valued logic that extends binary Boolean propositional logic t...
Steffen Michels Hybrid Probabilistic Logics: Theoretical Aspects, Algorithms and Experiments Probabi...
Moss (2018) argues that rational agents are best thought of not as having degrees of belief in vario...
We propose a general scheme for adding probabilistic reasoning capabilities to any knowledge represe...
Uncertain knowledge can be modeled by using graded probabilities rather than binary truth-values, bu...
AbstractWe offer a view on how probability is related to logic. Specifically, we argue against the w...
A central goal of AI is to reason efficiently in domains that are both complex and uncertain. Most a...
Automated reasoning about uncertain knowledge has many applications. One difficulty when developing ...
Probabilistic Reasoning in Intelligent Systems is a complete and accessible account of the theoretic...
This paper introduces and investigates Depth-bounded Belief functions, a logic-based representation ...
AbstractWe show that the principle of maximum U-uncertainty for ampliative possibilistic reasoning c...
AbstractWe consider a language for reasoning about probability which allows us to make statements su...
We propose a new model for forming and revising beliefs about unknown probabilities. To go beyond wh...
AbstractProbability is usually closely related to Boolean structures, i.e., Boolean algebras or prop...
In multi-agent systems, the knowledge of agents about other agents??? knowledge often plays a pivota...
Probability can be viewed as a multi-valued logic that extends binary Boolean propositional logic t...
Steffen Michels Hybrid Probabilistic Logics: Theoretical Aspects, Algorithms and Experiments Probabi...
Moss (2018) argues that rational agents are best thought of not as having degrees of belief in vario...