中文
相关论文

相关论文: A note on belief structures and S-approximation sp…

200 篇论文

In the interpretation of experimental data, one is actually looking for plausible explanations. We look for a measure of plausibility, with which we can compare different possible explanations, and which can be combined when there are…

人工智能 · 计算机科学 2010-12-30 Wan Ahmad Tajuddin Wan Abdullah

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…

人工智能 · 计算机科学 2022-02-17 Thierry Denoeux

The sure thing principle and the law of total probability are basic laws in classic probability theory. A disjunction fallacy leads to the violation of these two classical probability laws. In this paper, a new quantum dynamic belief…

人工智能 · 计算机科学 2017-03-08 Zichang He , Wen Jiang

In this paper we introduce a new kind of topological space, called 'structured space', which locally resembles various kinds of algebraic structures. This can be useful, for instance, to locally study a space that cannot be globally endowed…

综合数学 · 数学 2020-03-27 Manuel Norman

We present and examine a result related to uncertainty reasoning, namely that a certain plausibility space of Cox's type can be uniquely embedded in a minimal ordered field. This, although a purely mathematical result, can be claimed to…

人工智能 · 计算机科学 2015-11-24 Stefan Arnborg , Gunnar Sjödin

The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…

人工智能 · 计算机科学 2013-02-08 Henry E. Kyburg

Dempster-Shafer theory of evidence (D-S theory) is widely used in uncertain information process. The basic probability assignment(BPA) is a key element in D-S theory. How to measure the distance between two BPAs is an open issue. In this…

人工智能 · 计算机科学 2013-11-19 Hongming Mo , Xiaoyan Su , Yong Hu , Yong Deng

(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is…

人工智能 · 计算机科学 2016-11-26 Henry E. Kyburg

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

机器学习 · 计算机科学 2017-08-01 Konstantin Genin , Kevin T. Kelly

We provide a formal, simple and intuitive theory of rational decision making including sequential decisions that affect the environment. The theory has a geometric flavor, which makes the arguments easy to visualize and understand. Our…

机器学习 · 计算机科学 2012-02-10 Peter Sunehag , Marcus Hutter

We lay the groundwork for a formal framework that studies scientific theories and can serve as a unified foundation for the different theories within physics. We define a scientific theory as a set of verifiable statements, assertions that…

人工智能 · 计算机科学 2019-02-20 Gabriele Carcassi , Christine A. Aidala

The combination of evidence in Dempster-Shafer theory is compared with the combination of evidence in probabilistic logic. Sufficient conditions are stated for these two methods to agree. It is then shown that these conditions are minimal…

人工智能 · 计算机科学 2013-04-11 Daniel Hunter

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…

人工智能 · 计算机科学 2019-06-28 Fuyuan Xiao

Nearness theory comes into play in homotopy theory because the notion of closeness between points is essential in determining whether two spaces are homotopy equivalent. While nearness theory and homotopy theory have different focuses and…

代数拓扑 · 数学 2023-06-14 Melih Is , Ismet Karaca

Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…

综合数学 · 数学 2015-02-24 M. Abo-Elhamayel

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…

人工智能 · 计算机科学 2013-04-05 Mary McLeish

This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…

人工智能 · 计算机科学 2017-07-28 Chenwei Shi , Sonja Smets , Fernando R. Velázquez-Quesada

We revisit strong approximation theory from a new perspective, culminating in a proof of the Koml\'os-Major-Tusn\'ady embedding theorem for the simple random walk. The proof is almost entirely based on a series of soft arguments and easy…

概率论 · 数学 2010-07-05 Sourav Chatterjee

Evidential reasoning in expert systems has often used ad-hoc uncertainty calculi. Although it is generally accepted that probability theory provides a firm theoretical foundation, researchers have found some problems with its use as a…

人工智能 · 计算机科学 2013-04-15 Robert Fung , Chee Yee Chong

Although some information-theoretic measures of uncertainty or granularity have been proposed in rough set theory, these measures are only dependent on the underlying partition and the cardinality of the universe, independent of the lower…

人工智能 · 计算机科学 2011-02-02 Ping Zhu , Qiaoyan Wen