English
Related papers

Related papers: Toward a combination rule to deal with partial con…

200 papers

In this paper, we analyze the problem of how to adapt the concept of proportionality to situations where several perfectly divisible resources have to be allocated among certain set of agents that have exactly one claim which is used for…

Optimization and Control · Mathematics 2022-02-22 Rick K. Acosta-Vega , Encarnación Algaba , Joaquín Sánchez-Soriano

This paper may look like a glossary of the fusion rules and we also introduce new ones presenting their formulas and examples: Conjunctive, Disjunctive, Exclusive Disjunctive, Mixed Conjunctive-Disjunctive rules, Conditional rule,…

Artificial Intelligence · Computer Science 2009-01-29 Florentin Smarandache

In this paper, we propose to learn sources independence in order to choose the appropriate type of combination rules when aggregating their beliefs. Some combination rules are used with the assumption of their sources independence whereas…

Artificial Intelligence · Computer Science 2015-01-21 Mouna Chebbah , Mouloud Kharoune , Arnaud Martin , Boutheina Ben Yaghlane

One of the most important aspects in any treatment of uncertain information is the rule of combination for updating the degrees of uncertainty. The theory of belief functions uses the Dempster rule to combine two belief functions defined by…

Artificial Intelligence · Computer Science 2013-04-05 Michael S. K. M. Wong , P. Lingras

Information discounting plays an important role in the theory of belief functions and, generally, in information fusion. Nevertheless, neither classical uniform discounting nor contextual cannot model certain use cases, notably temporal…

Artificial Intelligence · Computer Science 2013-12-20 Marek Kurdej , Véronique Cherfaoui

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…

Artificial Intelligence · Computer Science 2019-06-28 Fuyuan Xiao

The Dempster-Shafer theory of evidence accumulation is one of the main tools for combining data obtained from multiple sources. In this paper a special case of combination of two bodies of evidence with non-zero conflict coefficient is…

Probability · Mathematics 2011-07-04 Andrzej K. Brodzik , Robert H. Enders

Mixed superposition rules, i.e., functions describing the general solution of a system of first-order differential equations in terms of a generic family of particular solutions of first-order systems and some constants, are studied. The…

Classical Analysis and ODEs · Mathematics 2013-01-01 Janusz Grabowski , Javier de Lucas

We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose modular, transitive relations for collective beliefs. They allow us to represent conflicting opinions and they have a clear…

Artificial Intelligence · Computer Science 2007-05-23 Pedrito Maynard-Reid , Daniel Lehmann

Dempster's rule of combination has been the most controversial part of the Dempster-Shafer (D-S) theory. In particular, Zadeh has reached a conjecture on the noncombinability of evidence from a relational model of the D-S theory. In this…

Artificial Intelligence · Computer Science 2013-04-11 John Yen

There are several contexts of non-monotonic reasoning where a priority between rules is established whose purpose is preventing conflicts. One formalism that has been widely employed for non-monotonic reasoning is the sceptical one known as…

Artificial Intelligence · Computer Science 2012-11-26 Guido Governatori , Francesco Olivieri , Simone Scannapieco , Matteo Cristani

In this paper a new mathematical procedure is presented for combining different pieces of evidence which are represented in the interval form to reflect our knowledge about the truth of a hypothesis. Evidences may be correlated to each…

Artificial Intelligence · Computer Science 2013-04-05 L. W. Chang , Rangasami L. Kashyap

Facing an unknown situation, a person may not be able to firmly elicit his/her preferences over different alternatives, so he/she tends to express uncertain preferences. Given a community of different persons expressing their preferences…

Artificial Intelligence · Computer Science 2017-08-11 Yiru Zhang , Tassadit Bouadi , Arnaud Martin

Most questionnaires offer ordered responses whose order is poorly studied via belief functions. In this paper, we study the consequences of a frame of discernment consisting of ordered elements on belief functions. This leads us to redefine…

Artificial Intelligence · Computer Science 2022-11-09 Arnaud Martin

In this paper one studies, within Dezert-Smarandache Theory (DSmT), the case when the sources of information provide imprecise belief functions/masses, and we generalize the DSm rules of combination (classic or hybrid rules) from scalar…

General Mathematics · Mathematics 2007-05-23 Jean Dezert , Florentin Smarandache

Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but appears to be computational complex, and not tractable at…

Artificial Intelligence · Computer Science 2007-05-23 Omar Doukari , Robert Jeansoulin

By analyzing the relationships among chance, weight of evidence and degree of beliefwe show that the assertion "probability functions are special cases of belief functions" and the assertion "Dempster's rule can be used to combine belief…

Artificial Intelligence · Computer Science 2013-02-28 Pei Wang

Dempster/Shafer (D/S) theory has been advocated as a way of representing incompleteness of evidence in a system's knowledge base. Methods now exist for propagating beliefs through chains of inference. This paper discusses how rules with…

Artificial Intelligence · Computer Science 2013-04-10 Paul K. Black , Kathryn Blackmond Laskey

A general method is given for revising degrees of belief and arriving at consistent decisions about a system of logically constrained issues. In contrast to other works about belief revision, here the constraints are assumed to be fixed.…

Artificial Intelligence · Computer Science 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

In the theory of belief functions, many measures of uncertainty have been introduced. However, it is not always easy to understand what these measures really try to represent. In this paper, we re-interpret some measures of uncertainty in…

Artificial Intelligence · Computer Science 2011-09-19 Florentin Smarandache , Arnaud Martin , Christophe Osswald