This fifth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different fields of applications and in mathematics, and is available in open-access. The collected contributions of this volume have either been published or presented after disseminating the fourth volume in 2015 in international conferences, seminars, workshops and journals, or they are new. The contributions of each part of this volume are chronologically ordered. First Part of this book presents some (...) theoretical advances on DSmT, dealing mainly with modified Proportional Conflict Redistribution Rules (PCR) of combination with degree of intersection, coarsening techniques, interval calculus for PCR thanks to set inversion via interval analysis (SIVIA), rough set classifiers, canonical decomposition of dichotomous belief functions, fast PCR fusion, fast inter-criteria analysis with PCR, and improved PCR5 and PCR6 rules preserving the (quasi-)neutrality of (quasi-)vacuous belief assignment in the fusion of sources of evidence with their Matlab codes. Because more applications of DSmT have emerged in the past years since the apparition of the fourth book of DSmT in 2015, the second part of this volume is about selected applications of DSmT mainly in building change detection, object recognition, quality of data association in tracking, perception in robotics, risk assessment for torrent protection and multi-criteria decision-making, multi-modal image fusion, coarsening techniques, recommender system, levee characterization and assessment, human heading perception, trust assessment, robotics, biometrics, failure detection, GPS systems, inter-criteria analysis, group decision, human activity recognition, storm prediction, data association for autonomous vehicles, identification of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classification. Finally, the third part presents interesting contributions related to belief functions in general published or presented along the years since 2015. These contributions are related with decision-making under uncertainty, belief approximations, probability transformations, new distances between belief functions, non-classical multi-criteria decision-making problems with belief functions, generalization of Bayes theorem, image processing, data association, entropy and cross-entropy measures, fuzzy evidence numbers, negator of belief mass, human activity recognition, information fusion for breast cancer therapy, imbalanced data classification, and hybrid techniques mixing deep learning with belief functions as well. (shrink)

The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar inequalities exist in algebras of multi-valued logic when the multiplication and addition operations are replaced with various T-norms and T-conorms respectively. For instance, we show that the rearrangement inequality holds when the T-norms and T-conorms are derived from Archimedean copulas.

Some arguments are good; others are not. How can we tell the difference? This article advances three proposals as a partial answer to this question. The proposals are keyed to arguments conditioned by different degrees of uncertainty: mild, where the argument’s premises are hedged with point-valued probabilities; moderate, where the premises are hedged with interval probabilities; and severe, where the premises are hedged with non-numeric plausibilities such as ‘very likely’ or ‘unconfirmed’. For mild uncertainty, the article proposes to apply a (...) principle referred to as ‘Jeffrey’s rule’, for the principle is a generalization of Jeffrey conditionalization. For moderate uncertainty, the proposal is to extend Jeffrey’s rule for use with probability intervals. For severe uncertainty, the article proposes that even when lack of probabilistic information prevents the application of Jeffrey’s rule, the rule can be adapted to these conditions with the aid of a suitable plausibility measure. Together, the three proposals introduce an approach to argument evaluation that complements established frameworks for evaluating arguments: deductive soundness, informal logic, argumentation schemes, pragma-dialectics, and Bayesian inference. Nevertheless, this approach can be looked at as a generalization of the truth and validity conditions of the classical criterion for sound argumentation. (shrink)

The degree to which abundances are evenly divided among the species of a given community is a basic property of any biological community. Several evenness indices have thus far been proposed in ecological literature. However, despite their vast potential applicability in ecological research, none seems to be generally preferred. In this paper, I first summarize the basic requirements that evenness measures should meet to adequately behave in ecological studies. Then, I discuss the major drawbacks of these requirements and propose an (...) alternative family of measures that are based on the notion of specificity used in fuzzy set theory for measuring the uncertainty associated with a fuzzy set. (shrink)

Some find it plausible that a sufficiently long duration of torture is worse than any duration of mild headaches. Similarly, it has been claimed that a million humans living great lives is better than any number of worm-like creatures feeling a few seconds of pleasure each. Some have related bad things to good things along the same lines. For example, one may hold that a future in which a sufficient number of beings experience a lifetime of torture is bad, regardless (...) of what else that future contains, while minor bad things, such as slight unpleasantness, can always be counterbalanced by enough good things. Among the most common objections to such ideas are sequence arguments. But sequence arguments are usually formulated in classical logic. One might therefore wonder if they work if we instead adopt many-valued logic. I show that, in a common many-valued logical framework, the answer depends on which versions of transitivity are used as premises. We get valid sequence arguments if we grant any of several strong forms of transitivity of 'is at least as bad as' and a notion of completeness. Other, weaker forms of transitivity lead to invalid sequence arguments. The plausibility of the premises is largely set aside here, but I tentatively note that almost all of the forms of transitivity that lead to valid sequence arguments seem intuitively problematic. Still, a few moderately strong forms of transitivity that might be acceptable lead to valid sequence arguments, although weaker statements of the initial value claims avoid these arguments at least to some extent. (shrink)

Additionally, the text shows how to develop computationally feasible methods to mesh with this framework.

Popper emphasised both the problem-solving nature of human knowledge, and the need to criticise a scientific theory as strongly as possible. These aims seem to contradict each other, in that the former stresses the problems that motivate scientific theories while the one ignores the character of the problems that led to the formation of the theories against which the criticism is directed. A resolution is proposed in which problems as such are taken as prime in the search for knowledge, and (...) subject to discussion. This approach is then applied to the problem of induction. Popper set great stake to his solution of it, but others doubted its legitimacy, in ways that are clarified by changing the form of the induction problem itself. That change draws upon logic, which is the subject of another application: namely, in contrast to Popper’s adhesion to classical logic as the only welcome form (because of the maximal strength of criticism that it dispenses), can other logics be used without abandoning his philosophy of criticism? (shrink)

The paper presents a ‘multiple agent’ logic where formulas are pairs of the form, made of a proposition and a subset of agents. The formula is intended to mean ‘ all agents in believe that is true’. The formal similarity of such formulas with those of possibilistic logic, where propositions are associated with certainty levels, is emphasised. However, the subsets of agents are organised in a Boolean lattice, while certainty levels belong to a totally ordered scale. The semantics of a (...) set of ‘multiple agent’ logic formulas is expressed by a mapping which associates a subset of agents with each interpretation. Soundness and completeness results are established. Then a joint extension of the multiple agent logic and possibilistic logic is outlined. In this extended logic, propositions are then associated with both sets of agents and certainty levels. A formula then expresses that ‘all agents in set believe that is true at least at some level’. The semantics is then given in terms of fuzzy sets of agents that find an interpretation more or less possible. A specific feature of possibilistic logic is that the inconsistency of a knowledge base is a matter of degree. The proposed setting enables us to distinguish between the global consistency of a set of agents and their individual consistency. In particular, given a set of multiple agent possibilistic formulas, one can compute the subset of agents that are individually consistent to some degree. (shrink)

A relatively new and exciting area of collaboration has begun between philosophy of mind and ethics. This paper attempts to explore aspects of this collaboration and how they bear upon traditional ethics. It is the author's contention that much of Western moral philosophy has been guided by largely unrecognized assumptions regarding reason, knowledge and conceptualization, and that when examined against empirical research in cognitive science, these assumptions turn out to be false -- or at the very least, unrealistic for creatures (...) with our cognitive structures. The fundamental tension between the Western idea of morality (as basically rule-following) and the way in which people actually confront and experience moral dilemmas is a result of our failure to take the insights of cognitive psychology seriously. This failure has had a dramatic impact on not only how we teach ethics, but how we attempt to live out lives. (shrink)

This volume presents mathematical game theory as an interface between logic and philosophy.

This is the first part of a two-part paper in which I conclude the process, initiated elsewhere, of tracking objective conditions of vagueness of representation from language to pictures, from philosophy to imaging science, from vagueness to approximation, from representation to reasoning, with a focus on the application of fuzzy set theory and its challenges.

In this paper we recall, improve, and extend several definitions, properties and applications of our previous 2019 research referred to NeutroAlgebras and AntiAlgebras (also called NeutroAlgebraic Structures and respectively AntiAlgebraic Structures). Let <A> be an item (concept, attribute, idea, proposition, theory, etc.). Through the process of neutrosphication, we split the nonempty space we work on into three regions {two opposite ones corresponding to <A> and <antiA>, and one corresponding to neutral (indeterminate) <neutA> (also denoted <neutroA>) between the opposites}, which may (...) or may not be disjoint – depending on the application, but they are exhaustive (their union equals the whole space). A NeutroAlgebra is an algebra which has at least one NeutroOperation or one NeutroAxiom (axiom that is true for some elements, indeterminate for other elements, and false for the other elements). A Partial Algebra is an algebra that has at least one Partial Operation, and all its Axioms are classical (i.e. axioms true for all elements). Through a theorem we prove that NeutroAlgebra is a generalization of Partial Algebra, and we give examples of NeutroAlgebras that are not Partial Algebras. We also introduce the NeutroFunction (and NeutroOperation). (shrink)