English
Related papers

Related papers: Rules, Belief Functions and Default Logic

200 papers

This paper is concerned with two theories of probability judgment: the Bayesian theory and the theory of belief functions. It illustrates these theories with some simple examples and discusses some of the issues that arise when we try to…

Artificial Intelligence · Computer Science 2013-04-15 Glenn Shafer

Mathematical Theory of Evidence called also Dempster-Shafer Theory (DST) is known as a foundation for reasoning when knowledge is expressed at various levels of detail. Though much research effort has been committed to this theory since its…

Artificial Intelligence · Computer Science 2017-07-14 Mieczysław A. Kłopotek

The issue of confidence factors in Knowledge Based Systems has become increasingly important and Dempster-Shafer (DS) theory has become increasingly popular as a basis for these factors. This paper discusses the need for an empirical…

Artificial Intelligence · Computer Science 2013-04-15 John F. Lemmer

This paper describes recent work on an ongoing project in medical diagnosis at the University of Guelph. A domain on which experts are not very good at pinpointing a single disease outcome is explored. On-line medical data is available over…

Artificial Intelligence · Computer Science 2013-04-05 Mary McLeish , P. Yao , T. Stirtzinger

We define a new notion of conditional belief, which plays the same role for Dempster-Shafer belief functions as conditional probability does for probability functions. Our definition is different from the standard definition given by…

Artificial Intelligence · Computer Science 2013-04-05 Ronald Fagin , Joseph Y. Halpern

Dempster-Shafer's model aims at quantifying degrees of belief But there are so many interpretations of Dempster-Shafer's theory in the literature that it seems useful to present the various contenders in order to clarify their respective…

Artificial Intelligence · Computer Science 2013-04-05 Philippe Smets

Mathematical Theory of Evidence (MTE), a foundation for reasoning under partial ignorance, is blamed to leave frequencies outside (or aside of) its framework. The seriousness of this accusation is obvious: no experiment may be run to…

Artificial Intelligence · Computer Science 2018-12-10 Mieczysław A. Kłopotek , Sławomir T. Wierzchoń

We revisit Zadeh's notion of "evidence of the second kind" and show that it provides the foundation for a general theory of epistemic random fuzzy sets, which generalizes both the Dempster-Shafer theory of belief functions and possibility…

Artificial Intelligence · Computer Science 2022-02-17 Thierry Denoeux

As a generalization of Dempster-Shafer theory, D number theory provides a framework to deal with uncertain information with non-exclusiveness and incompleteness. However, some basic concepts in D number theory are not well defined. In this…

Artificial Intelligence · Computer Science 2019-12-03 Xinyang Deng

We view the syntax-based approaches to default reasoning as a model-based diagnosis problem, where each source giving a piece of information is considered as a component. It is formalized in the ATMS framework (each source corresponds to an…

Artificial Intelligence · Computer Science 2013-02-28 Jerome Lang

Dempster-Shafer evidence theory has been widely used in various fields of applications, because of the flexibility and effectiveness in modeling uncertainties without prior information. However, the existing evidence theory is insufficient…

Artificial Intelligence · Computer Science 2019-06-28 Fuyuan Xiao

This paper examines the relationship between Shafer's belief functions and convex sets of probability distributions. Kyburg's (1986) result showed that belief function models form a subset of the class of closed convex probability…

Artificial Intelligence · Computer Science 2013-04-11 Paul K. Black

There are at least two ways to interpret numerical degrees of belief in terms of betting: (1) you can offer to bet at the odds defined by the degrees of belief, or (2) you can judge that a strategy for taking advantage of such betting…

Statistics Theory · Mathematics 2010-01-12 Glenn Shafer

While belief functions may be seen formally as a generalization of probabilistic distributions, the question of the interactions between belief functions and probability is still an issue in practice. This question is difficult, since the…

Logic in Computer Science · Computer Science 2011-10-03 Frederic Dambreville

Jeffrey's rule of conditioning has been proposed in order to revise a probability measure by another probability function. We generalize it within the framework of the models based on belief functions. We show that several forms of…

Artificial Intelligence · Computer Science 2013-03-08 Philippe Smets

The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that…

Artificial Intelligence · Computer Science 2013-02-18 Mathias Bauer

We present a new approach to dealing with default information based on the theory of belief functions. Our semantic structures, inspired by Adams' epsilon-semantics, are epsilon-belief assignments, where values committed to focal elements…

Artificial Intelligence · Computer Science 2013-02-21 Salem Benferhat , Alessandro Saffiotti , Philippe Smets

This paper explores belief inference in credal networks using Dempster-Shafer theory. By building on previous work, we propose a novel framework for propagating uncertainty through a subclass of credal networks, namely chains. The proposed…

Artificial Intelligence · Computer Science 2025-07-11 Marco Sangalli , Thomas Krak , Cassio de Campos

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

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

Logic in Computer Science · Computer Science 2007-05-23 Victor Marek , Jan Treur , Miroslaw Truszczynski