中文
相关论文

相关论文: Updating with Belief Functions, Ordinal Conditioni…

200 篇论文

Belief and plausibility are weaker measures of uncertainty than that of probability. They are motivated by the situations when full probabilistic information is not available. However, information can also be contradictory. Therefore, the…

人工智能 · 计算机科学 2022-05-31 Sabine Frittella , Ondrej Majer , Sajad Nazari

Evidence in probabilistic reasoning may be 'hard' or 'soft', that is, it may be of yes/no form, or it may involve a strength of belief, in the unit interval [0, 1]. Reasoning with soft, [0, 1]-valued evidence is important in many situations…

人工智能 · 计算机科学 2019-07-02 Bart Jacobs

Probabilistic epistemic argumentation allows for reasoning about argumentation problems in a way that is well founded by probability theory. Epistemic states are represented by probability functions over possible worlds and can be adjusted…

人工智能 · 计算机科学 2019-06-13 Nico Potyka , Sylwia Polberg , Anthony Hunter

Given a universe of discourse X-a domain of possible outcomes-an experiment may consist of selecting one of its elements, subject to the operation of chance, or of observing the elements, subject to imprecision. A priori uncertainty about…

人工智能 · 计算机科学 2013-03-26 Arthur Ramer

Epistemic uncertainty arises in lack of complete knowledge about the state of a system. There are multiple mathematical frameworks for measuring such uncertainty quantitatively, often referred to as imprecise probability theories. Inspired…

范畴论 · 数学 2026-03-05 Torgeir Aambø

There are several well-known justifications for conditioning as the appropriate method for updating a single probability measure, given an observation. However, there is a significant body of work arguing for sets of probability measures,…

人工智能 · 计算机科学 2014-08-12 Adam J. Grove , Joseph Y. Halpern

In this paper, we analyze the relationship between probability and Spohn's theory for representation of uncertain beliefs. Using the intuitive idea that the more probable a proposition is, the more believable it is, we study transformations…

人工智能 · 计算机科学 2013-01-30 Phan H. Giang , Prakash P. Shenoy

Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete. This is a fundamental problem in general, and of particular interest for Bayesian networks. Recently,…

人工智能 · 计算机科学 2007-05-23 Gert de Cooman , Marco Zaffalon

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…

人工智能 · 计算机科学 2013-03-08 Craig Boutilier

Information and uncertainty are closely related and extensively studied concepts in a number of scientific disciplines such as communication theory, probability theory, and statistics. Increasing the information arguably reduces the…

概率论 · 数学 2011-08-09 Jiahua Chen

The concept of updating a probability distribution in the light of new evidence lies at the heart of statistics and machine learning. Pearl's and Jeffrey's rule are two natural update mechanisms which lead to different outcomes, yet the…

计算机科学中的逻辑 · 计算机科学 2024-02-14 Bart Jacobs , Dario Stein

Methods for probability updating, of which Bayesian conditionalization is the most well-known and widely used, are modeling tools that aim to represent the process of modifying an initial epistemic state, typically represented by a prior…

计算机科学中的逻辑 · 计算机科学 2025-12-01 Tommaso Flaminio , Lluis Godo , Gluliano Rosella

In this paper we formulate the problem of inference under incomplete information in very general terms. This includes modelling the process responsible for the incompleteness, which we call the incompleteness process. We allow the process…

人工智能 · 计算机科学 2014-01-16 Marco Zaffalon , Enrique Miranda

This paper discusses belief revision under uncertain inputs in the framework of possibility theory. Revision can be based on two possible definitions of the conditioning operation, one based on min operator which requires a purely ordinal…

人工智能 · 计算机科学 2013-02-18 Didier Dubois , Henri Prade

We are interested in belief revision involving conditional statements where the antecedent is almost certainly false. To represent such problems, we use Ordinal Conditional Functions that may take infinite values. We model belief change in…

人工智能 · 计算机科学 2016-04-01 Aaron Hunter

Over the last decade, there has been growing interest in the use or measures or change in belief for reasoning with uncertainty in artificial intelligence research. An important characteristic of several methodologies that reason with…

人工智能 · 计算机科学 2014-07-29 Eric J. Horvitz , David Heckerman

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…

人工智能 · 计算机科学 2015-03-18 Mouna Chebbah , Arnaud Martin , Boutheina Ben Yaghlane

The conditioning in the Dempster-Shafer Theory of Evidence has been defined (by Shafer \cite{Shafer:90} as combination of a belief function and of an "event" via Dempster rule. On the other hand Shafer \cite{Shafer:90} gives a…

人工智能 · 计算机科学 2017-06-09 Andrzej Matuszewski , Mieczysław A. Kłopotek

Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or set-valued). This is a fundamental problem, and of particular interest for Bayesian networks.…

人工智能 · 计算机科学 2014-08-08 Gert de Cooman , Marco Zaffalon

Recently, it has been emphasized that the possibility theory framework allows us to distinguish between i) what is possible because it is not ruled out by the available knowledge, and ii) what is possible for sure. This distinction may be…

人工智能 · 计算机科学 2013-01-07 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade
‹ 上一页 1 2 3 10 下一页 ›