1. Introduction
It should be mentioned that the concept of fuzzy sets (FS) of type 2 has been defined by L. A. Zadeh [1]-[3] as an extension of ordinary FS. The further investigation of FS of type 2 was done in [4] and [5]. The FS of type 2 can be characterized by a fuzzy membership function the grade (or fuzzy grade), of which is a fuzzy set in the unit interval [0, 1], rather than a point in [0, 1]. Moreover, the algebraic properties of fuzzy grades under the operations
and
are slightly different from canonical ones. In this study we revisit operations, algebraic properties, and rule semantics in type-2 systems. We propose normalization of physical values and their mapping to a discrete universe. This article provides formulas for constructing membership functions using singletons and linguistic terms. We prove that fuzzy grades defined via triangular secondary MFs are convex. Note that in [6]-[8] the concept of type-2 fuzzy logic system (FLS) was introduced and thoroughly investigated. This paper studies several underexplored aspects of such type-2 FLS. In particular, this article argues that inference in type-2 FLS should rely on fuzzy implication, not t-norms, because implication better reflects semantic reasoning.
2. Fuzzy Logic Features
2.1. Fuzzy Logic Type-1
Let us consider the set of some kind of physical values
.
To normalize these values of
we utilize the following expression
(2.1)
Hence, in our research we always consider to operate on a universe of discourse
, i.e. on a set of integers rather, than on original physical scale of
. For this purpose, we use the following mapping
(2.2)
Let
be correspondent to
from (2.1) type-1 FS and let the relevant membership function (MF) of
in
be
, which is a crisp number in
.
Thus, the fuzzy set is presented as
(2.3)
On the other hand, to determine the estimates of the MF in terms of singletons from (2.3) in the form
, given (2.1) and (2.2) we propose the following procedure.
(2.4)
where
is a weight coefficient of the i-th input cluster [9] for
.
In more details from (2.4) we have
(2.5)
In type-1 fuzzy set
is represented as a triplet of the form
(2.6)
where
is normal FS with correspondent MF
.
could be the term from Table 1.
For each fuzzy set
one could define a linguistic term from the following set
(2.7)
The following Table 1 depicts linguistic terms from (2.7).
Table 1. Linguistic terms.
Value of variable |
|
|
low |
1 |
higher than low |
2 |
middle |
3 |
higher than middle |
4 |
high |
5 |
highest |
6 |
To determine the estimates of the MF in terms of singletons from (2.5) in the form
, for each k-th term from Table 1. we use the following procedure.
(2.8)
Note, that MF from (2.8) has triangular form, which is defined on entire universe of discourse
.
2.2. Fuzzy Logic Type-2
A type-2 fuzzy set in
is
and the membership grade of
in
is
, which is a type-1 FS in
. The elements of the domain of
are called primary memberships of
in
and the memberships of the primary memberships in
are called secondary memberships of
in
; the latter defines the possibilities for the primary membership, e.g., the type-2 FS,
has fuzzy grades (FS in
),
that can be denoted for each
as
(2.9)
And to define
in (2.7) we propose the following expression
(2.10)
Thus, we presume that membership grade
is normal, therefore
and the MF of fuzzy grades
we define as
(2.11)
Example 1.
Suppose the
, then from (2.10) we obtain
. And also suppose the
is the set of numbers
from (2.2), which is correspondent to the set of normalized values
from (2.1) and that
is FS of type-2 of Normalized Variable (Figure 1).
P = Normalized Variable = low/1 + middle/3 + high/5
Figure 1. Type-2 MF of “Normalized Variable” from Ex. 1.
From (2.9) and (2.11) by using terms from Table 1. we find the following membership grades (
and
are shown on Figure 1).
= low = 1/0 + 0.8/0.2 + 0.6/0.4 + 0.4/0.6 + 0.2/0.8 + 0/1
= middle = 0.6/0 + 0.8/0.2 + 1/0.4 + 0.8/0.6 + 0.6/0.8 + 0.4/1
= high = 0/0 + 0.2/0.2 + 0.4/0.4 + 0.6/0.6 + 0.8/0.8 + 1/1
Note, that in Ex. 1
, whereas
.
2.3. Operations of FS Type-2
Let us deliberate some important feature of fuzzy grades, which could be utilize later in this study.
Lemma 1.
If fuzzy grade
from (2.9) is defined as (2.10), then it is a convex for any integers
,
, i.e.
.
Proof:
Let us consider
from (2.11)
. We have the following cases
1)
;
2)
;
3)
;
4)
.
For case 1. from (2.11)
;
;
.
From where we have
For case 2. from (2.11)
;
;
.
Given that
we have
For case 3. from (2.11)
;
;
.
Given that
we have
For case 4. from (2.11)
;
;
.
From where we have
. ■
Let
and
be two fuzzy grades that is, FSs in
of FSs of type 2,
and
, respectively, represented as
(2.12)
(2.13)
where the functions
and
are MFs of fuzzy grades (FSs in
)
and
, respectively, and the values
and
in [0, 1] denote the grades for
and
in
, respectively. Thus, the operations for FS of type 2 are expressed by the following.
Union.
(2.14)
where
represent min and
denote max, whereas
is fuzzy grades operation join.
Intersection.
(2.15)
where
represent min, whereas
is fuzzy grades operation meet.
Remark.
In general, if
and
are two fuzzy grades that is, FSs in
of FS of type 2,
and
in
respectively, denoted as (2.12) and (2.13), and
is a binary operation defined in
, then the operation
can be extended to FS
and
by the definition relation (extension principle).
(2.16)
Example 2.
Let
and let fuzzy grades
and
be given as
= 0.8/0 + 1/0.2 + 0.8/0.4 + 0.6/0.6 + 0.4/0.8 + 0.2/1
= 0.2/0 + 0.4/0.2 + 0.6/0.4 + 0.8/0.6 + 1/0.8 + 0.8/1
Then for Join operation from (2.14) we have
= (0.8/0 + 1/0.2 + 0.8/0.4 + 0.6/0.6 + 0.4/0.8 + 0.2/1)
(0.2/0 + 0.4/0.2 + 0.6/0.4 + 0.8/0.6 + 1/0.8 + 0.8/1)
(0.8∧0.2)/(0∨0) |
(0.8∧0.4)/(0∨0.2) |
(0.8∧0.6)/(0∨0.4) |
(0.8∧0.8)/(0∨0.6) |
(0.8∧1)/(0∨0.8) |
(0.8∧0.8)/(0∨1) |
(1∧0.2)/(0.2∨0) |
(1∧0.4)/(0.2∨0.2) |
(1∧0.6)/(0.2∨0.4) |
(1∧0.8)/(0.2∨0.6) |
(1∧1)/(0.2∨0.8) |
(1∧0.8)/(0.2∨1) |
(0.8∧0.2)/(0.4∨0) |
(0.8∧0.4)/(0.4∨0.2) |
(0.8∧0.6)/(0.4∨0.4) |
(0.8∧0.8)/(0.4∨0.6) |
(0.8∧1)/(0.4∨0.8) |
(0.8∧0.8)/(0.4∨1) |
(0.6∧0.2)/(0.6∨0) |
(0.6∧0.4)/(0.6∨0.2) |
(0.6∧0.6)/(0.6∨0.4) |
(0.6∧0.8)/(0.6∨0.6) |
(0.6∧1)/(0.6∨0.8) |
(0.6∧0.8)/(0.6∨1) |
(0.4∧0.2)/(0.8∨0) |
(0.4∧0.4)/(0.8∨0.2) |
(0.4∧0.6)/(0.8∨0.4) |
(0.4∧0.8)/(0.8∨0.6) |
(0.4∧1)/(0.8∨0.8) |
(0.4∧0.8)/(0.8∨1) |
(0.2∧0.2)/(1∨0) |
(0.2∧0.4)/(1∨0.2) |
(0.2∧0.6)/(1∨0.4) |
(0.2∧0.8)/(1∨0.6) |
(0.2∧1)/(1∨0.8) |
(0.2∧0.8)/(1∨1) |
=
0.2/0 |
0.4/0.2 |
0.6/0.4 |
0.8/0.6 |
0.8/0.8 |
0.8/1 |
0.2/0.2 |
0.4/0.2 |
0.6/0.4 |
0.8/0.6 |
1/0.8 |
0.8/1 |
0.2/0.4 |
0.4/0.4 |
0.6/0.4 |
0.8/0.6 |
0.8/0.8 |
0.8/1 |
0.2/0.6 |
0.4/0.6 |
0.6/0.6 |
0.6/0.6 |
0.6/0.8 |
0.6/1 |
0.2/0.8 |
0.4/0.8 |
0.4/0.8 |
0.4/0.8 |
0.4/0.8 |
0.4/1 |
0.2/1 |
0.2/1 |
0.2/1 |
0.2/1 |
0.2/1 |
0.2/1 |
=0.2/0 + (0.2∨0.4∨0.4)/0.2 + (0.2∨0.4∨0.6∨0.6∨0.6)/0.4 + (0.2∨0.4∨0.6∨0.6∨0.8∨0.8∨0.8)/0.6 + (0.2∨0.4∨0.4∨0.4∨0.4∨ 0.6∨0.8∨1∨0.8)/0.8 + (0.2∨0.2∨0.2∨0.2∨0.2∨0.2∨0.4∨0.6∨0.8∨0.8∨0.8)/1 = 0.2/0 + 0.4/0.2 + 0.6/0.4 + 0.8/0.6 + 1/0.8 + 0.8/1
For Meet operation from (2.15)
= (0.8/0 + 1/0.2 + 0.8/0.4 + 0.6/0.6 + 0.4/0.8 + 0.2/1)
(0.2/0 + 0.4/0.2 + 0.6/0.4 + 0.8/0.6 + 1/0.8 + 0.8/1)
(0.8∧0.2)/(0∧0) |
(0.8∧0.4)/(0∧0.2) |
(0.8∧0.6)/(0∧0.4) |
(0.8∧0.8)/(0∧0.6) |
(0.8∧1)/(0∧0.8) |
(0.8∧0.8)/(0∧1) |
(1∧0.2)/(0.2∧0) |
(1∧0.4)/(0.2∧0.2) |
(1∧0.6)/(0.2∧0.4) |
(1∧0.8)/(0.2∧0.6) |
(1∧1)/(0.2∧0.8) |
(1∧0.8)/(0.2∧1) |
(0.8∧0.2)/(0.4∧0) |
(0.8∧0.4)/(0.4∧0.2) |
(0.8∧0.6)/(0.4∧0.4) |
(0.8∧0.8)/(0.4∧0.6) |
(0.8∧1)/(0.4∧0.8) |
(0.8∧0.8)/(0.4∧1) |
(0.6∧0.2)/(0.6∧0) |
(0.6∧0.4)/(0.6∧0.2) |
(0.6∧0.6)/(0.6∧0.4) |
(0.6∧0.8)/(0.6∧0.6) |
(0.6∧1)/(0.6∧0.8) |
(0.6∧0.8)/(0.6∧1) |
(0.4∧0.2)/(0.8∧0) |
(0.4∧0.4)/(0.8∧0.2) |
(0.4∧0.6)/(0.8∧0.4) |
(0.4∧0.8)/(0.8∧0.6) |
(0.4∧1)/(0.8∧0.8) |
(0.4∧0.8)/(0.8∧1) |
(0.2∧0.2)/(1∧0) |
(0.2∧0.4)/(1∧0.2) |
(0.2∧0.6)/(1∧0.4) |
(0.2∧0.8)/(1∧0.6) |
(0.2∧1)/(1∧0.8) |
(0.2∧0.8)/(1∧1) |
=
0.2/0 |
0.4/0 |
0.6/0 |
0.8/0 |
0.8/0 |
0.8/0 |
0.2/0 |
0.4/0.2 |
0.6/0.2 |
0.8/0.2 |
1/0.2 |
0.8/0.2 |
0.2/0 |
0.4/0.2 |
0.6/0.4 |
0.8/0.4 |
0.8/0.4 |
0.8/0.4 |
0.2/0 |
0.4/0.2 |
0.6/0.4 |
0.6/0.6 |
0.6/0.6 |
0.6/0.6 |
0.2/0 |
0.4/0.2 |
0.4/0.4 |
0.4/0.6 |
0.4/0.8 |
0.4/0.8 |
0.2/0 |
0.2/0.2 |
0.2/0.4 |
0.2/0.6 |
0.2/0.8 |
0.2/1 |
=(0.2∨0.2∨0.2∨0.2∨0.2∨0.2∨0.4∨0.6∨0.8∨0.8∨0.8)/0 + (0.2∨0.4∨0.4∨0.4∨0.4∨0.6∨0.8∨1∨0.8)/0.2 + (0.2∨0.4∨0.6∨ 0.6∨0.8∨0.8∨0.8)/0.4 + (0.2∨0.4∨0.6∨0.6∨0.6)/0.6 + (0.2∨0.4∨0.4)/0.8 + 0.2/1 = 0.8/0 + 1/0.2 + 0.8/0.4 + 0.6/0.6 + 0.4/0.8 + 0.2/1
Note. For both Join and Meet operations the number
of calculations needed was
, In our case for
we obtain
,
2.4. Fast Operations of FS Type-2
Now we introduce significantly more effective way to operate with type-2 FS.
Lemma 2.
If fuzzy grades
and
are both normal, i.e.
(2.17)
then the following features are taking place
;
;
;
Proof:
1)
2)
3)
4)
. ■
Corollary 1.
From the conditions (2.17) of Lemma 2 we can formulate the following fast and simple implementations of Meet and Join operations for type-2 FS
Note. For both Join and Meet operations the number
of calculations needed was
, In our case for
we obtain
, Therefore, this algorithm is more than 8.3 times faster than the original one.
3. Type-2 Fuzzy Logic System (FLS)
3.1. Type-2 FLS: Overview
In this chapter we revisit and reconsider some important features of type-2 FLS, in which the antecedent or consequent membership functions are type-2 FS.
Figure 2. The structure of a type-2 FLS.
Figure 2 shows the structure of a type-2 FLS [6]. It is very similar to the structure of a type-1 FLS. The fuzzifier maps the crisp input into a FS. This fuzzy set can, in general, be a type-2 set. The inference engine combines rules and gives a mapping from input type-2 FS to output type-2 FS. To do this one needs to find unions and intersections of type-2 FS sets, as well as compositions of type-2 relations. In the type-2 case, the output of the inference engine is a type-2 set. Usually, in type-2 FLS extended defuzzification is utilized, which gives a type-1 fuzzy set. Since this operation transforms type-2 output sets to the FLS to a type-1 set, this operation is called type reduction and the type-reduced set so obtained a type-reduced set. In [6]-[8] it was mentioned that in order to get a crisp output from a type-2 FLS, the type-reduced set has to be de-fuzzified.
Hence, in order to develop a type-2 FLS, one needs to be able to:
1) perform the set theoretic operations of union, intersection, and complement on type-2 sets;
2) know properties (e.g., commutativity, associativity, identity laws) of membership grades of type-2 sets;
3) deal with type-2 fuzzy relations and their compositions;
4) perform type reduction and defuzzification to obtain a set-valued or crisp output from the FLS [7] [8].
We will concentrate our attention on 1., 2. and 3.
3.2. Type-2 FLS: Inference
Let us consider a type-2 FLS having K inputs,
, and one output
. We assume that this FLS has M rules where the m-th rule has the form
(3.1)
This rule represents a type-2 fuzzy relation between the input space
and the output space
of the FLS. We denote the membership function of this type-2 relation as,
, where
denotes the Cartesian product of
and
. When an input
is applied, the composition of the fuzzy set
to which
have its place and the rule
is found by using the extended sup-star composition [6]-[8]
(3.2)
Let us take a look at the implication membership function from (3.2) for each m-th rule and denote it in the following form
(3.3)
We have to underline the fact that the implication operation in (3.3) is an essential element of a decision-making mechanism, known as Fuzzy Conditional Inference Rule (FCIR) of the (3.1) form.
Thus, we use the following type of implication [10]
(3.4)
For practical purposes, described down below, we will use Fuzzy Conditional Rule (FCR) [11] of the following type
(3.5)
From (3.3) the correspondent fuzzy binary relationship would look like that
(3.6)
Given (3.5) from (3.6) we are getting
(3.7)
To further investigate the structure and possible implementation of
in (3.7) we introduce the following.
Definition 1.
The set of values
| is a lattice (
), i.e.
and
.
Definition 2.
For a lattice
and N various normal fuzzy grades in
, i.e.
, we define
(3.8)
(3.9)
Therefore, the relevant indexes from (2.8) are
(3.10)
(3.11)
From (3.8) and (3.10) we define the upper fuzzy grade
for
(3.12)
And from (3.9) and (3.11) we define its lower counterpart
for
(3.13)
Based on Definition1 and Definition2 we shall prove the following.
Lemma 3.
If
is a lattice, then for N various normal fuzzy grades in
, i.e.
the following is taking place
(L3.1)
Proof:
From Definition 2 we have the set
|
.
Since
, from (3.12) and (3.13) we obtain the following
■
3.3. Type-2 FLS: Implication
It was mentioned in [6]-[8] that “the distinction between type-1 and type-2 is associated with the nature of the MFs, which is not important while forming ‘IF-THEN’ rules”. In opposite, from our point of view, this aspect needs additional attention. To further elaborate on type-2 FLS inference specificity and on correspondent “IF-THEN” rules formulation, we have to mention that in contrast with type-1 case, these rules are describing not a knowledge about input/output system behavior, but rather between our semantic interpretation/understanding of a nature of things under consideration. For this particular reason we are formulating the following.
Proposition 1.
Let
and
be two fuzzy grades in
of FS of type 2,
and
, represented as (2.12) and (2.13) correspondingly. Therefore, by applying an extension Zadeh principle [2.16], for type-2 FS implication operator we obtain the following
(3.14)
where
(3.15)
Let us represent the implication operation on type-2 FS from (3.14) and (3.15), as
(3.16)
We have to mark the fact that the implication operator (3.15). utilized in (3.14), indicates a degree of closeness between
values. That closeness, by the very nature of type-2 FS linguistic scales in use, might be interpreted as a degree of semantic similarity.
3.4. Type-2 FLS “IF-THEN” Rules Semantic Dissimilarity
Let us denote a fuzzy binary relationship
from (3.16) like a sum of three subsets, i.e. for
we have
(3.17)
Based on that let us first consider two subsets of
from (3.17)
and
for
, in which
In fact, these subsets, when
for
indicate the degree of semantic dissimilarity between
values. In connection with that we have to investigate the following feature of values within single interval
. For this reason, let us formulate the following.
Lemma 4.
If
, then the
Proof:
We have
. To get the value of
, which corresponds to
we use some basic principle of an optimization theory by taking first derivative of
and equalize it to zero, i.e.
. Since
, then we obtain
. Therefore, we are getting the following
. ■
Corollary 2.
From the result of Lemma 4 and from (3.15) we obtain the following
,
. And since
and
we have
and
.
Example 4.
Assume the
, then again from (2.10) we have
. Given the fact that
, then the closest value for both
,
and
,
expressions to max possible value of 0.25 is 0.16 (
;
) and (
;
).
3.5. Type-2 FLS: “IF-THEN” Rules Semantic Similarity
Now let us consider the issue of semantic similarity between
values, i.e. the subset
for
from (3.17), in which
,
.
From (3.16) and (3.17) the subset
for
is in fact, the major diagonal of a matrix
. And it looks like that
,
(3.18)
Lemma 5.
If MFs
and
of fuzzy grades
(L5.1)
are both normal (2.17), i.e.
(L5.2)
and if MF
, is an intersection of MFs
and
,
from (3.18), and it is presented as
(L5.3)
then it is normal and unimodal iff
.
Proof:
By definition of a logical conjunction operation, we have the following
,
. Therefore, from normality of MFs
and
from (2.17)
. In other words, we obtain the case when
is normal and unimodal. ■
Example 5.
1) The case when fuzzy grades for both input and output are “low”
= low = 1/0 + 0.8/.2 + 0.6/.4 + 0.4/.6 + 0.2/.8 + 0/1
= low = 1/0 + 0.8/.2 + 0.6/.4 + 0.4/.6 + 0.2/.8 + 0/1
1/1 |
0.8/0 |
0.6/0 |
0.4/0 |
0.2/0 |
0/0 |
0.8/0 |
0.8/1 |
0.6/0.12 |
0.4/08 |
0.2/04 |
0/0 |
0.6/0 |
0.6/0.12 |
0.6/1 |
0.4/0.16 |
0.2/08 |
0/0 |
0.4/0 |
0.4/08 |
0.4/0.16 |
0.4/1 |
0.2/0.12 |
0/0 |
0.2/0 |
0.2/04 |
0.2/08 |
0.2/0.12 |
0.2/1 |
0/0 |
0/0 |
0/0 |
0/0 |
0/0 |
0/0 |
0/1 |
The major diagonal of a matrix
is
= 1/1 + 0.8/1 + 0.6/1 + 0.4/1 + 0.2/1 + 0/1
2) The case when fuzzy grades for both input and output are “high”
= high = 0/0 + 0.2/0.2 + 0.4/0.4 + 0.6/0.6 +0.8/0.8 + 1/1
= high = 0/0 +0.2/0.2 +0.4/0.4 +0.6/0.6 +0.8/0.8 + 1/1
0/1 |
0/0 |
0/0 |
0/0 |
0/0 |
0/0 |
0/0 |
0.2/1 |
0.2/0.12 |
0.2/08 |
0.2/04 |
0.2/0 |
0/0 |
0.2/0.12 |
0.4/1 |
0.4/0.16 |
0.4/08 |
0.4/0 |
0/0 |
0.2/08 |
0.4/0.16 |
0.6/1 |
0.6/0.12 |
0.6/0 |
0/0 |
0.2/04 |
0.4/08 |
0.6/0.12 |
0.8/1 |
0.8/0 |
0/0 |
0.2/0 |
0.4/0 |
0.6/0 |
0.8/0 |
1/1 |
The major diagonal of a matrix
is
= 0/1 + 0.2/1 + 0.4/1 + 0.6/1 + 0.8/1 + 1/1
3) The case when fuzzy grades for both input and output are “middle”
= middle = 0.6/0 + 0.8/0.2 + 1/.4 +0.8/0.6 +0.6/0.8 +0.4/1
= middle = 0.6/0 +0.8/0.2 +1/.4 +0.8/0.6 +0.6/0.8 +0.4/1
0.6/1 |
0.6/0 |
0.6/0 |
0.6/0 |
0.6/0 |
0.4/0 |
0.6/0 |
0.8/1 |
0.8/0.12 |
0.8/08 |
0.6/04 |
0.4/0 |
0.6/0 |
0.8/0.12 |
1/1 |
0.8/0.16 |
0.6/08 |
0.4/0 |
0.6/0 |
0.8/08 |
0.8/0.16 |
0.8/1 |
0.6/0.12 |
0.4/0 |
0.6/0 |
0.6/04 |
0.6/08 |
0.6/0.12 |
0.6/1 |
0.4/0 |
0.4/0 |
0.4/0 |
0.4/0 |
0.4/0 |
0.4/0 |
0.4/1 |
The major diagonal of a matrix
is
= 0.6/1 + 0.8/1 + 1/1 + 0.8/1 + 0.6/1 + 0.4/1
Corollary 3.
If MFs
and
of fuzzy grades of an input
and an output
correspondingly, satisfy conditions (L5.1) - (L5.3) from Lemma 5, but
|
, then MF
from (L5.3) is subnormal.
Proof:
From (L5.1) and (L5.2) and
,|
, therefore
,
or
. Hence
. ■
Definition 3.
If
and
are two fuzzy grades in
of FS of type 2,
and
, respectively, represented as
(3.19)
then we call FS of type 2
from (3.19) Semantically Inversive in relation to FS of type 2
if
,
. In other words we have the following
(3.20)
Lemma 6.
If
, then
Proof:
From algebraic definition of a min of two numbers we obtain the following
Let present
in the following way
.
Thus, we have
And
Finally
■
Corollary 4.
Hence, from Lemma 6, if MF
is an intersection of MFs
and
,
from (3.19) and (3.2), and if it is presented as (L5.3), then it is subnormal and
. (3.21)
Example 6.
Here is a case of Semantically Inversive fuzzy grades “low” and “high” in use.
4) The case when input fuzzy grade is “low” and output one is “high”
= low = 1/0 + 0.8/0.2 + 0.6/0.4 + 0.4/0.6 + 0.2/0.8 + 0/1
= high = 0/0 + 0.2/0.2 + 0.4/0.4 + 0.6/0.6 + 0.8/0.8 + 1/1
0/1 |
0.2/0 |
0.4/0 |
0.6/0 |
0.8/0 |
1/0 |
0/0 |
0.2/1 |
0.4/0.12 |
0.6/08 |
0.8/04 |
0.8/0 |
0/0 |
0.2/0.12 |
0.4/1 |
0.6/0.16 |
0.6/08 |
0.6/0 |
0/0 |
0.2/08 |
0.4/0.16 |
0.4/1 |
0.4/0.12 |
0.4/0 |
0/0 |
0.2/04 |
0.2/08 |
0.2/0.12 |
0.2/1 |
0.2/0 |
0/0 |
0/0 |
0/0 |
0/0 |
0/0 |
0/1 |
The major diagonal of a matrix
is
= 0/1 + 0.2/1 + 0.4/1 + 0.4/1 + 0.2/1 + 0/1
3.6. Type-2 FLS: Improved Sup-Star Composition
Let, as usual
and
be two fuzzy grades in
of FS of type 2,
and
, represented as a system input (2.12) and an output (2.13) correspondingly. And let an input/output fuzzy relationship matrix be defined as
from (3.16). Hence, we use a Fuzzy Conditional Inference Rule (FCIR), formulated by means of “common sense” as a following conditional clause:
R = “IF (p is P), THEN (q is Q)” (3.22)
In other words, we use fuzzy conditional inference of the following type [11]:
Ant 1: If Input is P, then Output is Q
Ant2: Input is P'
-------------------------------------------- (3.23)
Cons: Output is Q'
where
and
. Note, that
and
are two fuzzy grades in
of FS of type 2,
and
from (3.23), represented as a system current input of type
(3.24)
Given a unary relationship
one can obtain the consequence
by Sup-Star Composition to
and
of type (3.16):
(3.25)
The value of an output fuzzy set
could be consider as
(3.26)
Lemma 7.
Assume that
and
are fuzzy grades in
of FS of type 2;
and
represent a system input (2.12) and an output (2.13), correspondingly and
represents a system current input (3.24). If an input/output fuzzy relationship matrix is defined as
from (3.16), then Sup-Star Composition (3.25) is reduced to the following
for
. Where
for
from (3.18) is the major diagonal of a matrix
.
Proof:
Since
from (3.17) consists of three subsets
,
and
, then from (3.25) we obtain
(3.27)
From (3.27) for meet operator
we consider the following three cases for
(3.28)
Note, that for all (3.28) cases the meet operation is realized for involved MFs like
for
, whereas for values
we have the following
(3.29)
From (3.29), given the result of Corollary 2,
and
. Hence,
, whereas
and therefore we can rewrite (3.27) as follows
■
Example 7.
Let
and
represent a system input (2.12) and an output (2.13).
Correspondingly, with the following fuzzy grades
= in between low and mid = 0.8/0 + 1/0.2 + 0.8/0.4 + 0.6/0.6 + 0.4/0.8 + 0.2/1
= in between low and mid = 0.8/0 + 1/0.2 + 0.8/0.4 + 0.6/0.6 + 0.4/0.8 + 0.2/1
An input/output fuzzy relationship matrix is
0.8/1 |
0.8/0 |
0.8/0 |
0.6/0 |
0.4/0 |
0.2/0 |
0.8/0 |
1/1 |
0.8/0.12 |
0.6/0.08 |
0.4/0.04 |
0.2/0 |
0.8/0 |
0.8/0.12 |
0.8/1 |
0.6/0.16 |
0.4/0.08 |
0.2/0 |
0.6/0 |
0.6/0.08 |
0.6/0.16 |
0.6/1 |
0.4/0.12 |
0.2/0 |
0.4/0 |
0.4/0.04 |
0.4/0.08 |
0.4/0.12 |
0.4/1 |
0.2/0 |
0.2/0 |
0.2/0 |
0.2/0 |
0.2/0 |
0.2/0 |
0.2/1 |
The major diagonal of a matrix
is
= 0.8/1 + 1/1 + 0.8/1 + 0.6/1 + 0.4/1 + 0.2/1
And let a system current input
from (3.24) to be
= middle = 0.6/0 + 0.8/0.2 + 1/0.4 + 0.8/0.6 + 0.6/0.8 + 0.4/1
The proposed version of Sup-Star Composition would be
(0.6∧0.8)/(0∧1) |
(0.6∧1)/(0∧1) |
(0.6∧0.8)/(0∧1) |
(0.6∧0.6)/(0∧1) |
(0.6∧0.4)/(0∧1) |
(0.6∧0.2)/(0∧1) |
(0.8∧0.8)/(0.2∧1) |
(0.8∧1)/(0.2∧1) |
(0.8∧0.8)/(0.2∧1) |
(0.8∧0.6)/(0.2∧1) |
(0.8∧0.4)/(0.2∧1) |
(0.8∧0.2)/(0.2∧1) |
(1∧0.8)/(0.4∧1) |
(1∧1)/(0.4∧1) |
(1∧0.8)/(0.4∧1) |
(1∧0.6)/(0.4∧1) |
(1∧0.4)/(0.4∧1) |
(1∧0.2)/(0.4∧1) |
(0.8∧0.8)/(0.6∧1) |
(0.8∧1)/(0.6∧1) |
(0.8∧0.8)/(0.6∧1) |
(0.8∧0.6)/(0.6∧1) |
(0.8∧0.4)/(0.6∧1) |
(0.8∧0.2)/(0.6∧1) |
(0.6∧0.8)/(0.8∧1) |
(0.6∧1)/(0.8∧1) |
(0.6∧0.8)/(0.8∧1) |
(0.6∧0.6)/(0.8∧1) |
(0.6∧0.4)/(0.8∧1) |
(0.6∧0.2)/(0.8∧1) |
(0.4∧0.8)/(1∧1) |
(0.4∧1)/(1∧1) |
(0.4∧0.8)/(1∧1) |
(0.4∧0.6)/(1∧1) |
(0.4∧0.4)/(1∧1) |
(0.4∧0.2)/(1∧1) |
=
0.6/0 |
0.6/0 |
0.6/0 |
0.6/0 |
0.4/0 |
0.2/0 |
0.8/0.2 |
0.8/0.2 |
0.8/0.2 |
0.6/0.2 |
0.4/0.2 |
0.2/0.2 |
0.8/0.4 |
1/0.4 |
0.8/0.4 |
0.6/0.4 |
0.4/0.4 |
0.2/0.4 |
0.8/0.6 |
0.8/0.6 |
0.8/0.6 |
0.6/0.6 |
0.4/0.6 |
0.2/0.6 |
0.6/0.8 |
0.6/0.8 |
0.6/0.8 |
0.6/0.8 |
0.4/0.8 |
0.2/0.8 |
0.4/1 |
0.4/1 |
0.4/1 |
0.4/1 |
0.4/1 |
0.2/1 |
Thus, a system current output
= 0.6/0 + 0.8/0.2 + 1/0.4 + 0.8/0.6 + 0.6/0.8 + 0.4/1
= middle
Example 8.
Here is a case of Semantically Inversive fuzzy grades for input “high” and output “low”.
= high = 0/0 + 0.2/0.2 + 0.4/0.4 + 0.6/0.6 + 0.8/0.8 + 1/1
= low = 1/0 + 0.8/.2 + 0.6/0.4 +0.4/0.6 +0.2/0.8 +0/1
0/1 |
0/0 |
0/0 |
0/0 |
0/0 |
0/0 |
0.2/0 |
0.2/1 |
0.2/0.12 |
0.2/08 |
0.2/04 |
0/0 |
0.4/0 |
0.4/0.12 |
0.4/1 |
0.4/0.16 |
0.2/08 |
0/0 |
0.6/0 |
0.6/08 |
0.6/0.16 |
0.4/1 |
0.2/0.12 |
0/0 |
0.8/0 |
0.8/04 |
0.6/08 |
0.4/0.12 |
0.2/1 |
0/0 |
1/0 |
0.8/0 |
0.6/0 |
0.4/0 |
0.2/0 |
0/1 |
The major diagonal of a matrix
is
= 0/1 + 0.2/1 + 0.4/1 + 0.4/1+ 0.2/1 + 0/1
And let a system current input
from (3.24) to be
= middle = 0.6/0 + 0.8/0.2 + 1/0.4 + 0.8/0.6 + 0.6/0.8 + 0.4/1
Again, the proposed version of Sup-Star Composition would be
(0.6∧0)/(0∧1) |
(0.6∧0.2)/(0∧1) |
(0.6∧0.4)/(0∧1) |
(0.6∧0.4)/(0∧1) |
(0.6∧0.2)/(0∧1) |
(0.6∧0)/(0∧1) |
(0.8∧0)/(0.2∧1) |
(0.8∧0.2)/(0.2∧1) |
(0.8∧0.4)/(0.2∧1) |
(0.8∧0.4)/(0.2∧1) |
(0.8∧0.2)/(0.2∧1) |
(0.8∧0)/(0.2∧1) |
(1∧0)/(0.4∧1) |
(1∧0.2)/(0.4∧1) |
(1∧0.4)/(0.4∧1) |
(1∧0.4)/(0.4∧1) |
(1∧0.2)/(0.4∧1) |
(1∧0)/(0.4∧1) |
(0.8∧0)/(0.6∧1) |
(0.8∧0.2)/(0.6∧1) |
(0.8∧0.4)/(0.6∧1) |
(0.8∧0.4)/(0.6∧1) |
(0.8∧0.2)/(0.6∧1) |
(0.8∧0)/(0.6∧1) |
(0.6∧0)/(0.8∧1) |
(0.6∧0.2)/(0.8∧1) |
(0.6∧0.4)/(0.8∧1) |
(0.6∧0.4)/(0.8∧1) |
(0.6∧0.2)/(0.8∧1) |
(0.6∧0)/(0.8∧1) |
(0.4∧0)/(1∧1) |
(0.4∧0.2)/(1∧1) |
(0.4∧0.4)/(1∧1) |
(0.4∧0.4)/(1∧1) |
(0.4∧0.2)/(1∧1) |
(0.4∧0)/(1∧1) |
=
0/0 |
0.2/0 |
0.4/0 |
0.4/0 |
0.2/0 |
0/0 |
0/0.2 |
0.2/0.2 |
0.4/0.2 |
0.4/0.2 |
0.2/0.2 |
0/0.2 |
0/0.4 |
0.2/0.4 |
0.4/0.4 |
0.4/0.4 |
0.2/0.4 |
0/0.4 |
0/0.6 |
0.2/0.6 |
0.4/0.6 |
0.4/0.6 |
0.2/0.6 |
0/0.6 |
0/0.8 |
0.2/0.8 |
0.4/0.8 |
0.4/0.8 |
0.2/0.8 |
0/0.8 |
0/1 |
0.2/1 |
0.4/1 |
0.4/1 |
0.2/1 |
0/1 |
Hence, a system current output
= 0.4/0 + 0.4/0.2 + 0.4/0.4 + 0.4/0.6 + 0.4/0.8 + 0.4/1
= unknown!!!
Thus, Semantically Inversive fuzzy grades shouldn’t be used for fuzzy relationship matrix build. Using them leads to fruitless results of type-2 FLS inference.
3.7. Type-2 FLS: Streamlined Inference
3.7.1. Knowledge Base
Remind that we still consider a type-2 FLS with K inputs,
, and one output
. Presumably this FLS has M rules, where the m-th rule has the form (3.1). Each rule represents a type-2 fuzzy relation between the input space
and the output space
of the FLS. And again, when an input
is applied, the composition of the fuzzy set
, to which
takes place and the rule
is found by using the extended sup-star composition (3.2). And also, the implication MF from (3.2) for each m-th rule is presented in in (3.3) form.
Given that in (3.13) we define the lower fuzzy grade
, then from (L3.1) of Lemma 3 we obtain for K inputs and m rules of FLS the following
(3.30)
From (3.7) given (3.30) we are getting for
(3.31)
Given that
We obtain
(3.32)
From (3.17) and (3.32) for each m rule
(3.33)
Now from (3.32) for each m rule and
we introduce
(3.34)
From (3.33) and (3.34) we obtain for each m rule
(3.35)
Hence, for
, whereas for values
from (3.35) we have the following
(3.36)
From (3.36) given the result of Corollary 2
(3.37)
Given (3.37) and from the results of Lemma 7 we obtain for each m rule its fuzzy relationship matrix major diagonals
(3.38)
The knowledge base for m rules of FLS has to be represented as a superposition of all single rules (3.38).
(3.39)
Note. The usability of FS
for it use in sup-max composition depends on the question of whether FSs for each m-th rule
are normal, unimodal and more or less semantically similar.
3.7.2. Decision Making
When an input
is applied with K inputs,
. The input space
is presented with the fuzzy grade
(3.40)
Given (3.39) and (3.40), the correspondent output space
will be obtained by using streamlined sup-star composition as the following fuzzy grade
4. Conclusions
The paper argues that inference in type-2 FLS should rely on fuzzy implication, not t-norms, because implication better reflects semantic reasoning. The work revisits operations, algebraic properties, and rule semantics in type-2 systems. It defines normalization of physical values and mapping to a discrete universe. It provides formulas for constructing membership functions using singletons and linguistic terms. It proves that fuzzy grades defined via triangular secondary MFs are convex. The paper revises several underexplored aspects of type-2 fuzzy sets and type-2 fuzzy logic systems (FLS), proposing:
a shift from t-norm-based inference to fuzzy implication-based inference. The paper argues that t-norm-based inference is semantically weak for type-2 rules.
dramatically faster method for join, meet, operations on type-2 fuzzy grades (Speedup: 8.3× faster), by providing full matrix-based definitions using Zadeh’s extension principle and by showing that these operations form a distributive lattice for convex fuzzy grades.
a new framework for analyzing semantic similarity and dissimilarity of type-2 IF-THEN rules,
an improved formulation of sup-star composition for inference. It uses a conditional implication operator and a more symmetric Fuzzy Conditional Rule (FCR).
The study demonstrates that standard sup-star composition is computationally heavy. The paper proves that, under the proposed implication operator, only the diagonal of the implication matrix matters. This greatly reduces computational cost in inference. Numerous examples illustrating the theory.