This reply to papers by Pearl and Shafer focuses on two issues underlying the debate on the validity o f using Dempster-Shafer theory, namely the requirement of a process-independent semantics and the a priori need for multiple uncertainty calculi. Pearl shows deficiencies of Dempster-Shafer theory in dealing with several instances o f commonsense reasoning in a process-independent manner. Alth...

The Dempster Shafer theory of evidence is developed here in a very general setting First its symbolic or algebraic part is discussed as a body of arguments which contains an allocation of support and an allowment of possibility for each hypothesis It is shown how such bodies of arguments arise in the theory of hints and in assumption based reasoning in logic A rule of combination of bodies of a...

We formulate Dempster Shafer Belief functions in terms of Propositional Logic, using the im­ plicit notion of provability underlying Demp­ ster Shafer Theory. The assignment of weights to the propositional literals enables the Belief functions to be explicitly computed using Net­ work Reliability techniques. Also, the updat­ ing of Belief functions using Dempster's Rule of Combination correspon...

The initial work introducing Dempster-Shafer (D-S) theory is found in Dempster (1967) and Shafer (1976). Since its introduction the very name causes confusion, a more general term often used is belief functions (both used intermittently here). Nguyen (1978) points out, soon after its introduction, that the rudiments of D-S theory can be considered through distributions of random sets. More furt...

An intrusion detection system (IDS) detects unauthorized manipulations of computer systems. Operation as feature reduction (including feature extraction and feature selection) plays an important role in the sense of improving classification performance and reducing the computational complexity of intrusion detection system. Feature reduction is even more important at online detection when less ...

We provide an approach to generalized metrics that covers various concepts of distance. In particular, we consider functorial maps which are weakly positive. Here, we focus on the supermodular case which generalizes dimension functions. We give a lattice-theoretically based construction for supermodular functorial maps, which generalize those arising from Dempster-Shafer-Theory. Within this fra...

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 paper, a new method to measure the distance of two BPAs is proposed. The proposed method is a generalized of existing evidence distance. Numerical examples are...