English
Related papers

Related papers: Making Decisions with Belief Functions

200 papers

Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…

Artificial Intelligence · Computer Science 2013-04-15 Marvin S. Cohen

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…

Logic in Computer Science · Computer Science 2018-04-25 AnneMarie Borg

An agent often has a number of hypotheses, and must choose among them based on observations, or outcomes of experiments. Each of these observations can be viewed as providing evidence for or against various hypotheses. All the attempts to…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

To model discrete-time finite-state uncertain processes, we argue for the use of a global belief model in the form of an upper expectation that is the most conservative one under a set of basic axioms. Our motivation for these axioms, which…

Probability · Mathematics 2021-01-12 Natan T'Joens , Jasper De Bock , Gert de Cooman

This article deals with plausible reasoning from incomplete knowledge about large-scale spatial properties. The availableinformation, consisting of a set of pointwise observations,is extrapolated to neighbour points. We make use of belief…

Artificial Intelligence · Computer Science 2013-01-14 Jerome Lang , Philippe Muller

The main goal of this paper is to describe an axiomatic utility theory for Dempster-Shafer belief function lotteries. The axiomatic framework used is analogous to von Neumann-Morgenstern's utility theory for probabilistic lotteries as…

Artificial Intelligence · Computer Science 2020-07-16 Thierry Denoeux , Prakash P. Shenoy

We present a representation of partial confidence in belief and preference that is consistent with the tenets of decision-theory. The fundamental insight underlying the representation is that if a person is not completely confident in a…

Artificial Intelligence · Computer Science 2013-04-11 David Heckerman , Holly B. Jimison

A conceptual foundation for approximation of belief functions is proposed and investigated. It is based on the requirements of consistency and closeness. An optimal approximation is studied. Unfortunately, the computation of the optimal…

Artificial Intelligence · Computer Science 2013-01-30 David Harmanec

Transparency is an essential requirement of machine learning based decision making systems that are deployed in real world. Often, transparency of a given system is achieved by providing explanations of the behavior and predictions of the…

Machine Learning · Computer Science 2021-05-18 André Artelt , Barbara Hammer

We present a propositional logic %which can be used to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

In this paper, an empirical evaluation of three inference methods for uncertain reasoning is presented in the context of Pathfinder, a large expert system for the diagnosis of lymph-node pathology. The inference procedures evaluated are (1)…

Artificial Intelligence · Computer Science 2023-01-26 David Heckerman

We present a semantics for adding uncertainty to conditional logics for default reasoning and belief revision. We are able to treat conditional sentences as statements of conditional probability, and express rules for revision such as "If A…

Artificial Intelligence · Computer Science 2013-03-08 Craig Boutilier

Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a…

Artificial Intelligence · Computer Science 2013-04-05 Mary McLeish

Researchers in explainable artificial intelligence have developed numerous methods for helping users understand the predictions of complex supervised learning models. By contrast, explaining the $\textit{uncertainty}$ of model outputs has…

Machine Learning · Statistics 2023-11-01 David S. Watson , Joshua O'Hara , Niek Tax , Richard Mudd , Ido Guy

The increasing incorporation of Artificial Intelligence in the form of automated systems into decision-making procedures highlights not only the importance of decision theory for automated systems but also the need for these decision…

Artificial Intelligence · Computer Science 2018-08-23 Tarek R. Besold , Sara L. Uckelman

The stability rule for belief, advocated by Leitgeb [Annals of Pure and Applied Logic 164, 2013], is a rule for rational acceptance that captures categorical belief in terms of $\textit{probabilistically stable propositions}$: propositions…

Logic in Computer Science · Computer Science 2025-09-03 Krzysztof Mierzewski

An automated explanation facility for Bayesian conditioning aimed at improving user acceptance of probability-based decision support systems has been developed. The domain-independent facility is based on an information processing…

Artificial Intelligence · Computer Science 2013-04-11 Christopher Elsaesser

Explanations of model behavior are commonly evaluated via proxy properties weakly tied to the purposes explanations serve in practice. We contribute a decision theoretic framework that treats explanations as information signals valued by…

Artificial Intelligence · Computer Science 2026-02-24 Ziyang Guo , Berk Ustun , Jessica Hullman

We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly different model that incorporates the notion of side information in…

Machine Learning · Computer Science 2007-07-13 Majid Fozunbal , Ton Kalker

In this paper, an optimization problem with uncertain objective function coefficients is considered. The uncertainty is specified by providing a discrete scenario set, containing possible realizations of the objective function coefficients.…

Data Structures and Algorithms · Computer Science 2023-03-10 Marc Goerigk , Romain Guillaume , Adam Kasperski , Paweł Zieliński