The present state of development of Dempster-Shafer theory is surveyed and its place among theories of dealing with uncertainty in AI is discussed. No knowledge of the theory is assumed.

We propose an extended relational database model which can model both uncertainty and imprecision in data. This model is based on Dempster-Shafer theory which has become popular in AI as an uncertainty reasoning tool. The definitions of Be1 and Pls functions in Dempster-Shafer theory are extended to compute the beliefs of various comparisons (e.g., equality, less than, etc.) between two basic p...

Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms may serve as evidence helping to repair produced inconsistencies. The Dempster-Shafer theory of evidence is a formalism, which allows appropriate interpretation of extractors’ confidence values. The paper presents an algorithm fo...

This paper presents an evidential approach to knowledge representation and inference wherein the principle of maximum entropy is applied to deal with uncertainty and incompleteness. It focuses on a restricted representation language similar in expressive power to semantic network formalisms, and develops a formal theory of evidential inheritance within this language. The theory applies to a lim...

BACKGROUND Limited data define what constitutes a minimal clinically important difference (MCID) on the EuroQol 5-Dimension (EQ-5D) health status index in persons with multiple sclerosis (PwMS). We sought to estimate the MCID for the EQ-5D health index in North American PwMS. METHODS PwMS completing the Patient Determined Disease Steps (PDDS) scale, 12-Item Multiple Sclerosis Walking Scale (M...

Dempster-Shafer (DS) theory is formulated in terms of propositional logic, using the implicit notion of provability underlying DS theory. Dempster-Shafer theory can be modeled in terms of propositional logic by the tuple (~, p), where S is a set of propositional clauses and p is an assignment of mass to each clause Ei c ~. It is shown that the disjunction of minimal support clauses for a clause...