1200 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 22, NO. 5, OCTOBER 2014
D. Monotonicity of IT2 Fuzzy Logic Systemss Using the
Karnik–Mendel Method
The Karnik–Mendel type-reduction and COS defuzzification
method (KM method) [1], [8], [47]–[50] are the most popular
out-processing methods. The monotonicity of such IT2 FLS is
studied in this section, while the monotonicity of the IT2 FLSs
using other out-processing method is studied in Section IV.
For the increasing monotonicity, we have the following results
for all y
n
l
(x) and y
n
r
(x).
Lemma 1: y
n
l
(x) and y
n
r
(x) (n =1,...,K) are all monoton-
ically increasing w.r.t x
k
if we have the following.
1) For any x
2
k
≥ x
1
k
∈ X
k
, 1 ≤ l ≤ m ≤ N
k
,wehave
μ
A
m
k
(x
2
k
)μ
A
l
k
(x
1
k
) ≥ μ
A
m
k
(x
1
k
)μ
A
l
k
(x
2
k
), where μ
A
m
k
means either μ
A
m
k
or μ
A
m
k
, and μ
A
l
k
means either μ
A
l
k
or
μ
A
l
k
.
2) w
i
1
···i
k −1
i
k
i
k +1
···i
p
≤ w
i
1
···i
k −1
(i
k
+1)i
k +1
···i
p
,
w
i
1
···i
k −1
i
k
i
k +1
···i
p
≤ w
i
1
···i
k −1
(i
k
+1)i
k +1
···i
p
for all the combinations of (i
1
,...,i
k−1
,i
k+1
,...,i
p
),
where i
k
=1, ···,N
k
− 1.
Proof: See Appendix A.
The conclusion in this lemma is very important. Most of the
proofs of the following theorems are based on the conclusion
provided by this Lemma.
For the monotonicity of the IT2 FLS using the KM method,
we have the following theorem.
Theorem 1: The IT2 FLS using the KM method is monoton-
ically increasing w.r.t x
k
if we have the following.
1) For any x
2
k
≥ x
1
k
∈ X
k
, 1 ≤ l ≤ m ≤ N
k
,wehave
μ
A
m
k
(x
2
k
)μ
A
l
k
(x
1
k
) ≥ μ
A
m
k
(x
1
k
)μ
A
l
k
(x
2
k
), where μ
A
m
k
means either μ
A
m
k
or μ
A
m
k
, and μ
A
l
k
means either μ
A
l
k
or
μ
A
l
k
.
2
2) w
i
1
···i
k −1
i
k
i
k +1
···i
p
≤ w
i
1
···i
k −1
(i
k
+1)i
k +1
···i
p
,
w
i
1
···i
k −1
i
k
i
k +1
···i
p
≤ w
i
1
···i
k −1
(i
k
+1)i
k +1
···i
p
for all the combinations of (i
1
,...,i
k−1
,i
k+1
,...,i
p
),
where i
k
=1, ···,N
k
− 1.
Proof: See Appendix B.
E. Monotonicity of T1 Fuzzy Logic System
As discussed in Section II-B, T1 FLS can be viewed as a
special case of the IT2 FLS using the KM method. Consequently,
for the monotonicity of T1 FLS, we have the following result.
Theorem 2: The T1 FLS is monotonically increasing w.r.t x
k
if we have the following.
1) For any x
2
k
≥ x
1
k
∈ X
k
, 1 ≤ l ≤ m ≤ N
k
,wehave
μ
A
m
k
(x
2
k
)μ
A
l
k
(x
1
k
) ≥ μ
A
m
k
(x
1
k
)μ
A
l
k
(x
2
k
).
2) w
i
1
···i
k −1
i
k
i
k +1
···i
p
≤ w
i
1
···i
k −1
(i
k
+1)i
k +1
···i
p
for all the
combinations of (i
1
,...,i
k−1
,i
k+1
,...,i
p
), where i
k
=
1,..., N
k
− 1.
Note that our result on the monotonicity of both IT2 FLS and
T1 FLS put no limitation on the shapes and types of IT2 FSs
2
In this study, we do not constrain the shape of the IT2 FSs, Hence, this
theorem holds for any kind of IT2 FSs, as long as this condition can be satisfied.
In the next section, we will show that this condition can easily be met when
Trapezoidal and Gaussian IT2 FSs are adopted.
(a) (b)
Fig. 1. Trapezoidal FSs: (a) Trapezoidal T1 FS. (b) Trapezoidal IT2 FS.
and T1 FSs. The second condition in Theorems 1 and 2 can be
easily checked. On the other hand, we need to explore how the
antecedent FSs in the rule base can meet the first condition in
both theorems. In the next section, we will study this issue.
III. M
ONOTONICITY CONDITIONS ON THE ANTECEDENT
PARTS OF FUZZY RULES
In practical FLSs, the most frequently used FSs are the Gaus-
sian FS and the Trapezoidal FS, a special case of which is the
Triangular FS [1]–[3]. Next, we will show how the Trapezoidal
and Gaussian FSs can satisfy the first condition in Theorems 1
and 2.
A. Monotonicity Conditions of the Trapezoidal Fuzzy Sets
Fig. 1(a) shows us a Trapezoidal T1 FS A, the MF of which
can be expressed as
μ
A
(x)=
⎧
⎪
⎪
⎪
⎨
⎪
⎪
⎪
⎩
0,x≤ a or x ≥ d
h
x−a
b−a
,a<x≤ b
h, b < x ≤ c
h
x−d
c−d
, c<x<d
(11)
where 0 <h≤ 1. We denote such a Trapezoidal T1 FS as
μ
A
(x)=μ
A
(x, a, b, c, d, h).
Note that Triangular T1 FSs are special cases of Trapezoidal
T1 FSs when b = c. Generally, in many applications, normal
Trapezoidal T1 FSs whose heights equal to 1 are adopted.
However, in this study, we consider the general case where
0 <h≤ 1.
By blurring the Trapezoidal T1 FS shown in Fig. 1(a), we can
obtain the Trapezoidal IT2 FS
A [see Fig. 1(b)], which can be
described by its lower and upper MFs μ
A
(x) and μ
A
(x) as
μ
A
(x)=μ
A
(x, a,b,c,d,h) (12)
μ
A
(x)=μ
A
(x, a, b, c, d, 1) (13)
where
a ≤ a, b ≤ b,c≤ c, d ≤ d. We denote such a Trape-
zoidal IT2 FS as μ
A
(x)=μ
A
(x, a, b, c, d, a,b,c,d,h).Again,
when b
= c and b = c, the Trapezoidal IT2 FS becomes a Tri-
angular IT2 FS.
Lemma 2: Consider two Trapezoidal T1 FSs μ
A
l
(x)=
μ
A
l
(x, a
l
,b
l
,c
l
,d
l
,h
l
),μ
A
r
(x)=μ
A
r
(x, a
r
,b
r
,c
r
,d
r
,h
r
).If
a
l
≤ a
r
,b
l
≤ b
r
,c
l
≤ c
r
,d
l
≤ d
r
(as shown in Fig. 2),
then, for any x
2
≥ x
1
∈ X,wehaveμ
A
r
(x
2
)μ
A
l
(x
1
) ≥
μ
A
r
(x
1
)μ
A
l
(x
2
).
Proof: See Appendix C.
From Lemma 2, we can make the following conclusion.