In this short note we give a formula for the unification of a class of fusion rules based on the conjunctive and/or disjunctive rule at the first step, and afterwards the redistribution of the conflicting and/or non-conflicting mass to the non-empty sets at the second step. Fusion of masses m1(.) and m2(.) is done directly proportional with some parameters and inversely proportional with other parameters (parameters that the hypotheses depend upon). The resulting mass is noted by mUFR(.). a) If variable y is directly proportional with variable p, then y=k1·p, where k1≠0 is a constant. b) If variable y is inversely proportional with variable q, then y=k2·(1/q), where k2≠0 is a constant; we can also say herein that y is directly proportional ...
Abstract. We give a new proof of a formula for the fusion rules for type A2 due to Bégin, Mathieu, ...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
In this short note we give a formula for the unification of a class of fusion rules based on the con...
Abstract: Since no fusion theory neither rule fully satisfy all needed applications, the author pro...
Since no fusion theory neither rule fully satisfy all needed applications, the author proposes a Uni...
fusion by doing redistribution of not only the conflicting mass, but also of masses of non-empty int...
Abstract- This short paper introduces two new fusion rules for combining quantitative basic belief a...
This short paper introduces two new fusion rules for combining quantitative basic belief assignments...
This paper introduces two new fusion rules for combining quantitative basic belief assignments. Thes...
Abstract: In this paper one proposes a simple algorithm of combini g the fusion rules, those rules ...
Abstract – One proposes a first alternative rule of combination to WAO (Weighted Average Operator) p...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
SIGLEAvailable from TIB Hannover: RN 5063(92-06) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
Abstract. We give a new proof of a formula for the fusion rules for type A2 due to Bégin, Mathieu, ...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
In this short note we give a formula for the unification of a class of fusion rules based on the con...
Abstract: Since no fusion theory neither rule fully satisfy all needed applications, the author pro...
Since no fusion theory neither rule fully satisfy all needed applications, the author proposes a Uni...
fusion by doing redistribution of not only the conflicting mass, but also of masses of non-empty int...
Abstract- This short paper introduces two new fusion rules for combining quantitative basic belief a...
This short paper introduces two new fusion rules for combining quantitative basic belief assignments...
This paper introduces two new fusion rules for combining quantitative basic belief assignments. Thes...
Abstract: In this paper one proposes a simple algorithm of combini g the fusion rules, those rules ...
Abstract – One proposes a first alternative rule of combination to WAO (Weighted Average Operator) p...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
SIGLEAvailable from TIB Hannover: RN 5063(92-06) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
International audienceIn a modal logic L, a unifier of a formula ϕ is a substitution σ such that σ(ϕ...
Abstract. We give a new proof of a formula for the fusion rules for type A2 due to Bégin, Mathieu, ...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...