Search

Liu's inference is a process of deriving consequences from uncertain knowledge or evidence via the tool of conditional uncertainty. Using membership functions, this paper derives some expressions of Liu's inference rule for uncertain systems. This paper also discusses Liu's inference rule with multiple antecedents and with multiple if-then rules. [ABSTRACT FROM AUTHOR]

The subject of this paper is a generalized approach to relative scalar cardinalities of fuzzy sets. In the main part of the paper, we discuss basic properties of triangular norm-based relative cardinality such as valuation property, the cartesian product rule and complementary rule. Examples of cardinalities satisfying those properties are also given. [ABSTRACT FROM AUTHOR]

In this paper we study phase space relations in a certain class of discrete dynamical systems over graphs. The systems we investigate are called Sequential Dynamical Systems (SDSs), which are a class of dynamical systems that provide a framework for analyzing computer simulations. Specifically, an SDS consists of (i) a finite undirected graph Y with vertex set {1,2,…,n} where each vertex has associated a binary state, (ii) a collection of Y-local functions (Fi,Y)i∈v[Y] with $F_{i,Y}: \mathbb{F}_2^n\to \mathbb{F}_2^n$ and (iii) a permutation π of the vertices of Y. The SDS induced by (i)–(iii) is the map \[ [F_Y,\pi] = F_{\pi(n),Y} \circ \cdots \circ F_{\pi(1),Y}\,. \] The paper is motivated by a general reduction theorem for SDSs which guarantees the existence of a phase space embedding induced by a covering map between the base graphs of two SDSs. We use this theorem to obtain information about phase spaces of certain SDSs over binary hypercubes from the dynamics of SDSs over complete graphs. We also investigate covering maps over binary hypercubes, $Q_2^n$, and circular graphs, Circn. In particular we show that there exists a covering map $\phi: Q_2^n\to K_{n+1}$ if and only if 2n≡0 mod n+1. Furthermore, we provide an interpretation of a class of invertible SDSs over circle graphs as right-shifts of length n-2 over {0,1}2n-2. The paper concludes with a brief discussion of how we can extend a given covering map to a covering map over certain extended graphs. [ABSTRACT FROM AUTHOR]

One of the most important issues in the field of fuzzy preference modelling is the construction of a fuzzy strict preference relation and a fuzzy indifference relation from a fuzzy weak preference relation. Here, we focus on a particular class of fuzzy weak preference relations, the so-called fuzzy orderings. The definition of a fuzzy ordering involves a fuzzy equivalence relation and, in this paper, the latter will be considered as the corresponding fuzzy indifference relation. We search for fuzzy strict preference relations compatible with a given fuzzy ordering and its fuzzy indifference relation. In many situations, depending on the t-norm and t-conorm used, this quest results in a unique fuzzy strict preference relation. Our aim is to characterize these fuzzy strict preference relations and to study their transitivity. [ABSTRACT FROM AUTHOR]

Intuitionistic fuzzy set, was introduced by Atanassov, has been applied to many different fields, such as logic programming, pattern recognition, and decision making, etc. However, so far there has been few investigation on how to transform attribute tested values of alternative into a intuitionistic fuzzy number, and then complete decision making by intuitionistic fuzzy information. In this paper, the original attribute value (objective information) are characterized by crisp number which are given by decision maker. We define the concepts of supporting, opposing and neutral set of alternative respectively, develop an approach for transform attribute values into intuitionistic fuzzy number, and determine the order of alternatives based on the score and the degree of accuracy of the intuitionistic fuzzy number. Finally, a practical example is provided to illustrate the developed method. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the concept of interval-valued nested set on the universal set X, propose two representation theorems and equivalent classification theorem of interval-valued fuzzy set. These works can be used in setting up the basic theory of interval-valued fuzzy set. [ABSTRACT FROM AUTHOR]

In this paper, the reasons for the shortcoming of Zadeh's fuzzy set theory — it cannot correctly reflect different kinds of fuzzy phenomenon in the natural world — are discussed. In addition, the proof of the error of Zadeh's fuzzy set theory — it incorrectly defined the set complement that cannot exist in Zadeh's fuzzy set theory — is proposed. This error of Zadeh's fuzzy set theory causes confusion in thinking, logic and conception. It causes the seriously mistaken belief that logics of fuzzy sets necessarily go against classical and normal thinking, logic and conception. Two new fuzzy set theories, C-fuzzy set theory and probability-like fuzzy set theory, the N-fuzzy set theory, are proposed. The two are equivalent, and both overcome the error and shortcoming of Zadeh's fuzzy set theory, and they are consistent with normal, natural and classical thinking, logic and concepts. The similarities of N-fuzzy set theory with probability theory are also examined. [ABSTRACT FROM AUTHOR]

In this paper, by using Sengupta and Pal's method of comparison of interval numbers and a new set of arithmetic operations for interval numbers, we propose a theory for the study of arithmetic operations on interval numbers. [ABSTRACT FROM AUTHOR]

Interval-valued fuzzy sets constitute an extension of fuzzy sets which give an interval approximating the "real" (but unknown) membership degree. Interval-valued fuzzy sets are equivalent to intuitionistic fuzzy sets in the sense of Atanassov which give both a membership degree and a non-membership degree, whose sum must be smaller than or equal to 1. Both are equivalent to L-fuzzy sets w.r.t. a special lattice L*. In fuzzy set theory, an important class of triangular norms is the class of those that satisfy the residuation principle. In a previous paper5 we gave a construction for t-norms on L* satisfying the residuation principle which are not t-representable. In this paper we investigate the Smets-Magrez axioms and some other properties for the residual implicator generated by such t-norms. [ABSTRACT FROM AUTHOR]

Intuitionistic fuzzy sets are a generalization of ordinary fuzzy sets which are characterized by a membership function and a non-membership function. In this paper we consider the problem of ranking a set of intuitionistic fuzzy numbers. We adopt a statistical viewpoint and interpret each intuitionistic fuzzy number as an ensemble of ordinary fuzzy numbers. This enables us to define a fuzzy rank and a characteristic vagueness factor for each intuitionistic fuzzy number. We show the reasonablesness of the results obtained by examining several test cases. [ABSTRACT FROM AUTHOR]

Rough set theory is a relatively new mathematical tool for use in computer applications in circumstances which are characterized by vagueness and uncertainty. In this paper, we introduce the concepts of information entropy, rough entropy and knowledge granulation in rough set theory, and establish the relationships among those concepts. These results will be very helpful for understanding the essence of concept approximation and establishing granular computing in rough set theory. [ABSTRACT FROM AUTHOR]

In this paper, two new formulas of fuzzy entropy induced by distances between two intuitionistic fuzzy sets are given. These entropy measures can be computed easily and give reliable results. Some examples are illustrated for the comparison with Burillo and Bustince (1996) and Szmidt and Kacprzyk (2001). [ABSTRACT FROM AUTHOR]

In belief functions, there is a total measure of uncertainty that quantify the lack of knowledge and verifies a set of important properties. It is based on two measures: maximum of entropy and non-specificity. In this paper, we prove that the maximum of entropy verifies the same set of properties in a more general theory as credal sets and we present an algorithm that finds the probability distribution of maximum entropy for another interesting type of credal sets as probability intervals. [ABSTRACT FROM AUTHOR]