English
Related papers

Related papers: Constructing Lower Probabilities

200 papers

The theory of belief functions manages uncertainty and also proposes a set of combination rules to aggregate opinions of several sources. Some combination rules mix evidential information where sources are independent; other rules are…

Artificial Intelligence · Computer Science 2015-03-18 Mouna Chebbah , Arnaud Martin , Boutheina Ben Yaghlane

This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical…

Artificial Intelligence · Computer Science 2013-02-01 Didier Dubois , Helene Fargier , Henri Prade

We establish an Ergodic Theorem for lower probabilities, a generalization of standard probabilities widely used in applications. As a by-product, we provide a version for lower probabilities of the Strong Law of Large Numbers.

Functional Analysis · Mathematics 2015-08-07 Simone Cerreia-Vioglio , Fabio Maccheroni , Massimo Marinacci

We introduce a logical framework for reasoning about "uncertain interpretations" and investigate two key applications: a new semantics for implication capturing a kind of "meaning entailment", and a conservative notion of "evidentially…

Logic in Computer Science · Computer Science 2025-03-21 Adam Bjorndahl

The construction of the Bayesian credible (confidence) interval for a Poisson observable including both the signal and background with and without systematic uncertainties is presented. Introducing the conditional probability satisfying the…

Data Analysis, Statistics and Probability · Physics 2015-05-13 Yong-Sheng Zhu

The AGM theory of belief revision has become an important paradigm for investigating rational belief changes. Unfortunately, researchers working in this paradigm have restricted much of their attention to rather simple representations of…

Artificial Intelligence · Computer Science 2013-01-30 Frans Voorbraak

This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.

Number Theory · Mathematics 2007-05-23 N. A. Carella

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

Logic in Computer Science · Computer Science 2023-02-14 Shenghua Feng , Mingshuai Chen , Han Su , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Naijun Zhan

For any class of one-sided $1-\alpha$ confidence intervals with a certain monotonicity ordering on the random confidence limit, the smallest interval, in the sense of the set inclusion for the difference of two proportions of two…

Statistics Theory · Mathematics 2012-11-19 Weizhen Wang

The belief construction is a fundamental technique for transforming partially observable systems to fully observable ones while preserving the relevant semantics. It plays a central role in the analysis of partially observable systems, in…

Logic in Computer Science · Computer Science 2026-05-19 Mayuko Kori , Kazuki Watanabe

Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance…

Artificial Intelligence · Computer Science 2014-04-15 Meizhu Li , Qi Zhang , Xinyang Deng , Yong Deng

Given a set of probability measures $\mathcal{P}$ representing an agent's knowledge on the elements of a sigma-algebra $\mathcal{F}$, we can compute upper and lower bounds for the probability of any event $A\in\mathcal{F}$ of interest. A…

Statistics Theory · Mathematics 2023-05-09 Michele Caprio , Teddy Seidenfeld

The problem of assigning probabilities when little is known is analized in the case where the quanities of interest are physical observables, i.e. can be measured and their values expressed by numbers. It is pointed out that the assignment…

Data Analysis, Statistics and Probability · Physics 2012-08-29 Vesselin I. Dimitrov

One important obstacle in applying Dempster-Shafer Theory (DST) is its relationship to frequencies. In particular, there exist serious difficulties in finding factorizations of belief functions from data. In probability theory…

Artificial Intelligence · Computer Science 2018-12-17 Andrzej Matuszewski , Mieczysław A. Kłopotek

In an earlier article [J. Schubert, On nonspecific evidence, Int. J. Intell. Syst. 8(6), 711-725 (1993)] we established within Dempster-Shafer theory a criterion function called the metaconflict function. With this criterion we can…

Artificial Intelligence · Computer Science 2007-05-23 Johan Schubert

Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code…

Machine Learning · Statistics 2017-07-13 Robert Zinkov , Chung-chieh Shan

We present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can…

Artificial Intelligence · Computer Science 2012-05-14 Daniel Andrade , Bernhard Sick

In building Bayesian belief networks, the elicitation of all probabilities required can be a major obstacle. We learned the extent of this often-cited observation in the construction of the probabilistic part of a complex influence diagram…

Artificial Intelligence · Computer Science 2013-01-30 Linda C. van der Gaag , Silja Renooij , Cilia L. M. Witteman , Berthe M. P. Aleman , Babs G. Taal

In this research, Minkowski type functions which are constructed on certain probability distributions, are introduced. There are investigated differential, integral, and other properties of these functions.

Functional Analysis · Mathematics 2025-01-14 Symon Serbenyuk

A general method is given for revising degrees of belief and arriving at consistent decisions about a system of logically constrained issues. In contrast to other works about belief revision, here the constraints are assumed to be fixed.…

Artificial Intelligence · Computer Science 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell