On Some Equivalence Relations between Incidence Calculus and Dempster-Shafer Theory of Evidence
Incidence Calculus and Dempster-Shafer Theory of Evidence are both theories to describe agents' degrees of belief in propositions, thus being appropriate to represent uncertainty in reasoning systems. This paper presents a straightforward equivalence proof between some special cases of these theories.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Incidence Calculus: A Mechanism for Probabilistic Reasoning
Mechanisms for the automation of uncertainty are required for expert systems. Sometimes these mechanisms need to obey the properties of probabilistic reasoning. A purely numeric mechanism, like those proposed so far, can…
Fuzzy Core Equivalence in Large Economies: A Role for the Infinite-Dimensional Lyapunov Theorem
We present the equivalence between the fuzzy core and the core under minimal assumptions. Due to the exact version of the Lyapunov convexity theorem in Banach spaces, we clarify that the additional structure of commodity…
Relaxing partition admissibility in Cluster-DAGs: a causal calculus with arbitrary variable clustering
Cluster DAGs (C-DAGs) provide an abstraction of causal graphs in which nodes represent clusters of variables, and edges encode both cluster-level causal relationships and dependencies arisen from unobserved confounding. …
Relational Algebra and Calculus with SQL Null Values
The logic of nulls in databases has been subject of investigation since their introduction in Codd's Relational Model, which is the foundation of the SQL standard. We show a logical characterisation of a first-order frag…
RelationA Mathematical Framework for Superintelligent Machines
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously l…