Some Revised Aspects of Type-2 Fuzzy Sets Use

Abstract

In this work we revise some less investigated aspects of a type-2 fuzzy logic system (FLS), which can handle rule uncertainties. The specificity of this type-2 FLS usually comprises the operations of fuzzification, inference, and output processing. We focus on “inference”, which in our opinion should be based on an operation of fuzzy implication, rather than on commonly used t-norm one. This paper also investigates some original properties of fuzzy grades under the operations of join , meet and implication , which are defined by using the extension principal L. A. Zadeh, and shows that convex fuzzy grades form normal convex fuzzy grades, which in their turn form a distributive lattice under and . In this article we present much more effective implementation of such operations. We also explore an important feature of IF-THEN rules for type-2 fuzzy sets. This study introduces the notion of semantic similarity measure of these rules and their importance for logical inference in type-2 FLS. All theoretical concepts presented in this work are thoroughly illustrated by relevant examples.

Share and Cite:

Tserkovny, A. (2026) Some Revised Aspects of Type-2 Fuzzy Sets Use. Journal of Software Engineering and Applications, 19, 241-265. doi: 10.4236/jsea.2026.197011.

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 p[ P min , P max ] .

To normalize these values of p we utilize the following expression

p norm = p P min P max P min (2.1)

Hence, in our research we always consider to operate on a universe of discourse U , i.e. on a set of integers rather, than on original physical scale of p[ P min , P max ] . For this purpose, we use the following mapping

γ:PU|u=Ent[ CardU p norm ] (2.2)

Let P be correspondent to p norm from (2.1) type-1 FS and let the relevant membership function (MF) of uU in P be μ p ( u ) , which is a crisp number in [ 0,1 ] .

Thus, the fuzzy set is presented as

P= U μ p ( u ) u (2.3)

On the other hand, to determine the estimates of the MF in terms of singletons from (2.3) in the form μ p ( u i )/ u i |i[ 1,CardU ] , given (2.1) and (2.2) we propose the following procedure. i[ 1,Card U   ]

μ p ( u i )= { 1 1 CardU1 | iEnt[ ( CardU ) p norm ] | } α i (2.4)

where α i is a weight coefficient of the i-th input cluster [9] for i[ 1,CardU ] .

In more details from (2.4) we have

P= μ p ( u 1 ) u 1 + μ p ( u 2 ) u 2 ++ μ p ( u n ) u n = i μ p ( u i ) u i , u i U (2.5)

In type-1 fuzzy set P is represented as a triplet of the form

P={ p,U, P ˜ > },pT( u ), u i U,i= 1,CardU ¯ (2.6)

where P ˜ is normal FS with correspondent MF μ p :U[ 0,1 ] . T( u ) could be the term from Table 1.

For each fuzzy set P one could define a linguistic term from the following set

T( u )={ low,,highest } (2.7)

The following Table 1 depicts linguistic terms from (2.7).

Table 1. Linguistic terms.

Value of variable

T( k )

kU

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 μ p ( u i )/ u i |i[ 1,CardU ] , for each k-th term from Table 1. we use the following procedure.

μ p ( u i )={ 1 1 CardU1 | ik | },i[ 1,CardU ] (2.8)

Note, that MF from (2.8) has triangular form, which is defined on entire universe of discourse U .

2.2. Fuzzy Logic Type-2

A type-2 fuzzy set in X is P ˜ and the membership grade of xX in P ˜ is μ P ˜ ( x ) , which is a type-1 FS in [ 0,1 ] . The elements of the domain of μ P ˜ ( x ) are called primary memberships of x in P ˜ and the memberships of the primary memberships in μ P ˜ ( x ) are called secondary memberships of x in P ˜ ; the latter defines the possibilities for the primary membership, e.g., the type-2 FS, P ˜ X has fuzzy grades (FS in J X [ 0,1 ] ), μ P ˜ ( x ) that can be denoted for each xX as μ P ˜ :X [ 0,1 ] J X

μ P ˜ ( x )= f( v 1 ) v 1 + f( v 2 ) v 2 ++ f( v n ) v n = i f( v i ) v i , v i J X (2.9)

And to define v i J X in (2.7) we propose the following expression

v i ={ i Card J X 1 }, v i J X ,i[ 1,Card J X ] (2.10)

Thus, we presume that membership grade μ P ˜ ( x ) is normal, therefore ! l * [ 1,Card J X ]|f( v l * )= max i[ 1,Card J X ] { f( v i ) }==1 and the MF of fuzzy grades f( v i ) we define as

f( v i )={ 1 1 Card J X 1 | i l * | },i[ 1,Card J X ] (2.11)

Example 1.

Suppose the Card J X =6 , then from (2.10) we obtain J X ={ 0,0.2,0.4,0.6,0.8,1 }[ 0,1 ] . And also suppose the X={ 1,2,3,4,5,6 } is the set of numbers u from (2.2), which is correspondent to the set of normalized values p norm from (2.1) and that P 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 ( μ P ˜ ( 1 ), μ P ˜ ( 3 ) and μ P ˜ ( 5 ) are shown on Figure 1).

μ P ˜ ( 1 ) = low = 1/0 + 0.8/0.2 + 0.6/0.4 + 0.4/0.6 + 0.2/0.8 + 0/1

μ P ˜ ( 3 ) = middle = 0.6/0 + 0.8/0.2 + 1/0.4 + 0.8/0.6 + 0.6/0.8 + 0.4/1

μ P ˜ ( 5 ) = 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 J 1 = J 3 = J 5 = J X , whereas J 2 = J 4 = J 6 = .

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 μ P ( x )= i f( v i ) v i , v i J X

from (2.9) is defined as (2.10), then it is a convex for any integers i,k[ 1,Card J X ] , j[ 1,Card J X ]|ijk , i.e. f( v j )min{ f( v i ),f( v k ) }|ijk .

Proof:

Let us consider f( v n1 ),f( v n ),f( v n+1 ) from (2.11) n[ 1,Card J X   ] . We have the following cases

1) n+1 l * ;

2) n l * ,n+1> l * ;

3) n1 l * ,n> l * ;

4) n1> l * .

For case 1. from (2.11)

i=n+1 Δ n+1 =| i l * |= l * n1 ;

i=n Δ n =| i l * |= l * n ;

i=n1 Δ n1 =| i l * |= l * n+1 .

From where we have

Δ n1 > Δ n > Δ n+1 f( v n1 )<f( v n )<f( v n+1 )

f( v n )>min{ f( v n1 ),f( v n+1 ) }

For case 2. from (2.11)

i=n Δ n =| i l * |= l * n ;

i=n1 Δ n1 =| i l * |= l * n+1 ;

i=n+1 Δ n+1 =| i l * |=n+1 l * .

Given that Δ n+1 Δ n =2 l * 2n1|n l * Δ n+1 Δ n <0 we have

Δ n1 > Δ n > Δ n+1 f( v n1 )<f( v n )<f( v n+1 )

f( v n )>min{ f( v n1 ),f( v n+1 ) }

For case 3. from (2.11)

i=n1 Δ n1 =| i l * |= l * n+1 ;

i=n Δ n =| i l * |=n l * ;

i=n+1 Δ n+1 =| i l * |=n+1 l * .

Given that Δ n Δ n1 =2n2 l * 1|n> l * Δ n Δ n1 <0 we have

Δ n1 > Δ n > Δ n+1 f( v n1 )<f( v n )<f( v n+1 )

f( v n )>min{ f( v n1 ),f( v n+1 ) }

For case 4. from (2.11)

i=n1 Δ n1 =| i l * |=n1 l * ;

i=n Δ n =| i l * |=n l * ;

i=n+1 Δ n+1 =| i l * |=n+1 l * .

From where we have

Δ n+1 > Δ n > Δ n1 f( v n+1 )<f( v n )<f( v n1 )

f( v n )>min{ f( v n1 ),f( v n+1 ) } . ■

Let μ P ( x ) and μ Q ( x ) be two fuzzy grades that is, FSs in J X [ 0,1 ] of FSs of type 2, P and Q , respectively, represented as

μ P ( x )= f( v 1 ) v 1 + f( v 2 ) v 2 ++ f( v n ) v n = i f( v i ) v i , v i J X , (2.12)

μ Q ( x )= g( w 1 ) w 1 + g( w 2 ) w 2 ++ g( w n ) w n = j g( w j ) w j , w j J X , (2.13)

where the functions f and g are MFs of fuzzy grades (FSs in J X [ 0,1 ] ) μ P ( x ) and μ Q ( x ) , respectively, and the values f( v i ) and g( w j ) in [0, 1] denote the grades for v i and w j in J X , respectively. Thus, the operations for FS of type 2 are expressed by the following.

Union.

PQ μ PQ ( x )= μ p ( x ) μ Q ( x )= i f( v i ) v i j g( w j ) w j = i,j ( f( v i )g( w j ) )/ ( v i w j ) , (2.14)

where represent min and denote max, whereas is fuzzy grades operation join.

Intersection.

PQ μ PQ ( x )= μ p ( x ) μ Q ( x )= i f( v i ) v i j g( w j ) w j = i,j ( f( v i )g( w j ) )/ ( v i w j ) , (2.15)

where represent min, whereas is fuzzy grades operation meet.

Remark.

In general, if μ P ( x ) and μ Q ( x ) are two fuzzy grades that is, FSs in J X [ 0,1 ] of FS of type 2, P and Q in X respectively, denoted as (2.12) and (2.13), and is a binary operation defined in X , then the operation can be extended to FS P and Q by the definition relation (extension principle).

PQ μ PQ ( x )= μ p ( x ) μ Q ( x )= i f( v i ) u i j g( w j ) w j = i,j ( f( v i )g( w j ) )/ ( v i w j ) (2.16)

Example 2.

Let J X ={ 0,0.2,0.4,0.6,0.8,1 } and let fuzzy grades μ P ( x ) and μ Q ( x ) be given as

μ P ( x ) = 0.8/0 + 1/0.2 + 0.8/0.4 + 0.6/0.6 + 0.4/0.8 + 0.2/1

μ Q ( x ) = 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

μ p ( x )  μ Q ( x ) = (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)

MATRIX( μ p ( x ) μ Q ( x ) )=

(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)

(11)/(0.20.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)

μ p ( x )  μ Q ( x ) = (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)

MATRIX( μ p ( x ) μ Q ( x ) )=

(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)

(11)/(0.20.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 N 1 of calculations needed was N 1 =3×Card J X 2 , In our case for Card J X =6 we obtain N 1 =108 ,

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

μ P ( x )= i f( v i ) v i , v i J X

and

μ Q ( x )= j g( w j ) w j , w j J X

are both normal, i.e.

{ ! k * [ 1,Card J X ]|f( v k * )= max i[ 1,CardJ ] { f( v i ) }==1; ! l * [ 1,CardJ ]|g( w l * )= max j[ 1,CardJ ] { g( w j ) }==1 (2.17)

then the following features are taking place

v k * , w l * J| v k * w l * μ p ( x ) μ Q ( x )= μ p ( x ) ;

v k * , w l * J| v k * > w l * μ p ( x ) μ Q ( x )= μ Q ( x ) ;

v k * , w l * J| v k * w l * μ p ( x ) μ Q ( x )= μ Q ( x ) ;

v k * , w l * J| v k * > w l * μ p ( x ) μ Q ( x )= μ p ( x )

Proof:

1) v k * , w l * J| v k * w l * b * = v k * w l * = v k *

l( b * )=l( v k * )=f( v k * )=1

μ p ( x ) μ Q ( x )=f( v k * )+ v i w j b * f( v i )g( w j )

μ p ( x ) μ Q ( x )=1+ v i w j b * f( v i )g( w j )= μ p ( x )

2) v k * , w l * J| v k * > w l * b * = v k * w l * = w l *

l( b * )=l( w l * )=g( w l * )=1

μ p ( x ) μ Q ( x )=g( w l * )+ v i w j b * f( v i )g( w j )

μ p ( x ) μ Q ( x )=1+ v i w j b * f( v i )g( w j )= μ Q ( x )

3) v k * , w l * J| v k * w l * b * = v k * w l * = w l *

l( b * )=l( w l * )=g( w l * )=1

μ p ( x ) μ Q ( x )=g( w l * )+ v i w j b * f( v i )g( w j )

μ p ( x ) μ Q ( x )=1+ v i w j b * f( v i )g( w j )= μ Q ( x )

4) v k * , w l * J| v k * > w l * b * = v k * w l * = v k *

l( b * )=l( w l * )=f( v k * )=1

μ p ( x ) μ Q ( x )=f( v k * )+ v i w j b * f( v i )g( w j )

μ p ( x ) μ Q ( x )=1+ v i w j b * f( v i )g( w j )= μ p ( x ) . ■

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

μ p ( x ) μ Q ( x )={ μ p ( x ),if k * l * , μ Q ( x ),othervise

μ p ( x ) μ Q ( x )={ μ p ( x ),if k * l * , μ Q ( x ),othervise

Note. For both Join and Meet operations the number N 2 of calculations needed was N 2 =( 2×Card J X )+1 , In our case for Card J X =6 we obtain N 2 =13 , 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, x 1 X 1 , x 2 X 2 ,, x K X K , and one output yY . We assume that this FLS has M rules where the m-th rule has the form

R m :IF x 1 is P 1 m ˜ and x 2 is P 2 m ˜ andand x K is P K m ˜ THENyis Q ˜ m (3.1)

This rule represents a type-2 fuzzy relation between the input space X 1 × X 2 ×× X K and the output space Y of the FLS. We denote the membership function of this type-2 relation as,

m[ 1,M ]| μ P 1 m ˜ × P 2 m ˜ ×× P K m ˜ Q ˜ m ( x,y ) , where P 1 m ˜ × P 2 m ˜ ×× P K m ˜ denotes the Cartesian product of P 1 m ˜ , P 2 m ˜ ,, P K m ˜ and x={ x 1 , x 2 ,, x K } . When an input x is applied, the composition of the fuzzy set P ˜ to which x have its place and the rule R m is found by using the extended sup-star composition [6]-[8]

μ P ˜ P 1 m ˜ × P 2 m ˜ ×× P K m ˜ Q ˜ m ( y )= x P ˜ [ μ P ˜ ( x ) μ P 1 m ˜ × P 2 m ˜ ×× P K m ˜ Q ˜ m ( x,y ) ] (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

μ P 1 m ˜ × P 2 m ˜ ×× P K m ˜ Q ˜ m ( x,y )=[ i[ 1,K ] μ P i m ˜ ( x ) ] μ Q m ˜ ( y ) (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]

PQ={ ( 1p )q, p>q, 1, pq (3.4)

For practical purposes, described down below, we will use Fuzzy Conditional Rule (FCR) [11] of the following type

( PQ )( ¬P¬Q )={ ( 1q )p, p<q, 1, p=q, ( 1p )q, p>q. (3.5)

From (3.3) the correspondent fuzzy binary relationship would look like that m[ 1,M ]

μ P 1 m ˜ × P 2 m ˜ ×× P K m ˜ Q ˜ m ( x,y )={ [ i[ 1,K ] μ P i m ˜ ( x ) ] μ Q m ˜ ( y ) } { ( 1[ i[ 1,K ] μ P i m ˜ ( x ) ] )( 1 μ Q m ˜ ( y ) ) } (3.6)

Given (3.5) from (3.6) we are getting m[ 1,M ]

μ P 1 m ˜ × P 2 m ˜ ×× P K m ˜ Q ˜ m ( x,y ) ={ ( 1[ i[ 1,K ] μ P i m ˜ ( x ) ] ) μ Q m ˜ ( y ), [ i[ 1,K ] μ P i m ˜ ( x ) ]< μ Q m ˜ ( y ), 1, [ i[ 1,K ] μ P i m ˜ ( x ) ]= μ Q m ˜ ( y ), ( 1 μ Q m ˜ ( y ) )[ i[ 1,K ] μ P i m ˜ ( x ) ], μ Q m ˜ ( y )<[ i[ 1,K ] μ P i m ˜ ( x ) ]. (3.7)

To further investigate the structure and possible implementation of [ i[ 1,K ] μ P i m ˜ ( x ) ] in (3.7) we introduce the following.

Definition 1.

The set of values J X ={ v i }={ v 1 , v 2 ,, v N }[ 0,1 ] | is a lattice ( J X , ), i.e. v 1 < v 2 << v N and a,b J X |abab=a;ab=b .

Definition 2.

For a lattice J X [ 0,1 ] and N various normal fuzzy grades in J X , i.e.

i[ 1,Card J X ],j[ 1,N ]| μ P j ( x )= i f j ( v ij ) v ij

! k j * [ 1,Card J X ]| f j ( v k j * )= max i[ 1,CardJ ] { f j ( v ij ) }==1 , we define

v upper = max j[ 1,N ] { v k j * } (3.8)

v lower = min j[ 1,N ] { v k j * } (3.9)

Therefore, the relevant indexes from (2.8) are

i upper =( Card J X ) v upper  (3.10)

i lower =( Card J X ) v lower (3.11)

From (3.8) and (3.10) we define the upper fuzzy grade

for i[ 1,Card J X ]

μ P upper ( x )= f( v upper ) v upper + i i upper f( v i ) v i = 1 v upper + i i upper f( v i ) v i (3.12)

And from (3.9) and (3.11) we define its lower counterpart

for i[ 1,Card J X ]

μ P lower ( x )= f( v lower ) v lower + i i lower f( v i ) v i = 1 v lower + i i lower f( v i ) v i . (3.13)

Based on Definition1 and Definition2 we shall prove the following.

Lemma 3.

If J X [ 0,1 ] is a lattice, then for N various normal fuzzy grades in J X , i.e.

μ P j ( x )= i f j ( v i )/ v i |i[ 1,Card J X ],j1,N

the following is taking place

j= 1,N ¯ μ P j ( x )= j= 1,N ¯ i=Card J X f j ( v i ) v i = μ P lower ( x ) j= 1,N ¯ μ P j ( x )= j= 1,N ¯ i= 1,Card J X ¯ f j ( v i ) v i = μ P higher ( x ) (L3.1)

Proof:

From Definition 2 we have the set V J X ={ v k * }={ v k 1 * , v k 2 * ,, v k M * } | V[ v lower , v upper ] .

Since v lower , v upper J X | v lower < v upper , from (3.12) and (3.13) we obtain the following

j= 1,N ¯ μ P j ( x )= μ P lower ( x ) μ P upper ( x )= μ P lower ( x ),

j= 1,N ¯ μ P j ( x )= μ P lower ( x ) μ P upper ( x )= μ P upper ( x ).

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 μ P ( x ) and μ Q ( x ) be two fuzzy grades in J X [ 0,1 ] of FS of type 2, P and Q , 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

PQ μ PQ ( x )= μ p ( x ) μ Q ( x ) = i f( u i ) u i j g( w j ) w j = i,j ( f( u i )g( w j ) )/ ( u i w j ) , (3.14)

where

( uw )={ ( 1w )u, u<w, 1, u=w, ( 1u )w, u>w. (3.15)

Let us represent the implication operation on type-2 FS from (3.14) and (3.15), as

μ p ( x ) μ Q ( x )=R( u,w )= i,j ( f( u i )g( w j ) )/ ( u i w j ) = u i < w j f( u i )g( w j ) ( 1 w j ) u i + u i = w j f( u i )g( w j ) 1 + u i > w j f( u i )g( w j ) ( 1 u i ) w j (3.16)

We have to mark the fact that the implication operator (3.15). utilized in (3.14), indicates a degree of closeness between u,w J X 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 R( u,w ) from (3.16) like a sum of three subsets, i.e. for i,j[ 1,Card J X ] we have

R( u,w )= R u i < w j ( u i , w j )+ R u i = w j ( u i , w j )+ R u i > w j ( u i , w j ) (3.17)

Based on that let us first consider two subsets of R( u,w ) from (3.17) R u i < w j ( u i , w j ) and R u i > w j ( u i , w j ) for i,j[ 1,Card J X ] , in which

( uw )={ ( 1w )u,u<w, ( 1u )w,u>w.

In fact, these subsets, when R u i w j ( u i , w j ) for i,j[ 1,Card J X ] indicate the degree of semantic dissimilarity between u,w J X values. In connection with that we have to investigate the following feature of values within single interval a[ 0,1 ] . For this reason, let us formulate the following.

Lemma 4.

If f( a )=a( 1a ),a[ 0,1 ] , then the max a[ 0,1 ] [ f( a ) ]=0.25

Proof:

We have f( a )=a( 1a )=a a 2 . To get the value of a , which corresponds to max a[ 0,1 ] [ a( 1a ) ] we use some basic principle of an optimization theory by taking first derivative of f( a ) and equalize it to zero, i.e. f ( a )=0 . Since f ( a )=12a=0 , then we obtain a=0.5 . Therefore, we are getting the following max a[ 0,1 ] [ f( a ) ]=0.25 . ■

Corollary 2.

From the result of Lemma 4 and from (3.15) we obtain the following a,b[ 0,1 ] , f( a,b )={ a( 1b ),a<b ( 1a )b,a>b . And since aba( 1b )< max a[ 0,1 ] [ a( 1a ) ] and ( 1a )b< max a[ 0,1 ] [ a( 1a ) ] we have a( 1b )<0.25 and ( 1a )b<0.25 .

Example 4.

Assume the Card J X =6 , then again from (2.10) we have J X ={ 0,0.2,0.4,0.6,0.8,1 }[ 0,1 ] . Given the fact that u,w J X , then the closest value for both ( 1w )u , u<w and ( 1u )w , u>w expressions to max possible value of 0.25 is 0.16 ( u=0.4 ; w=0.6 ) and ( u=0.6 ; w=0.4 ).

3.5. Type-2 FLS: “IF-THEN” Rules Semantic Similarity

Now let us consider the issue of semantic similarity between u, w J X values, i.e. the subset R u i = w j ( u i , w j ) for i,j[ 1,Card J X ] from (3.17), in which ( uw )=1 , u=w .

From (3.16) and (3.17) the subset R u i = w j ( u i , w j ) for i,j[ 1,Card J X ] is in fact, the major diagonal of a matrix R( u,w ) . And it looks like that i,j[ 1,Card J X ] ,

R u i = w j ( u i , w j )= u i = w j f( u i )g( w j ) 1 (3.18)

Lemma 5.

If MFs f( u ) and g( w ) of fuzzy grades

μ P ( x )= i f( u i ) u i , u i J X and μ Q ( x )= j f( w j ) w j , w j J X (L5.1)

are both normal (2.17), i.e.

{ ! k * [ 1,Card J X ]|f( u k * )= max i[ 1,Card J X ] { f( u i ) }==1; ! l * [ 1,Card J X ]|g( w l * )= max j[ 1,Card J X ] { g( w j ) }==1 (L5.2)

and if MF h( v )|v J X , is an intersection of MFs f( u ) and g( w ) , h( v )=f( u )g( w ) from (3.18), and it is presented as

h( v )= m[ 1,Card J X ] h( v m )= u i w j =1 f( u i )g( w j ), (L5.3)

then it is normal and unimodal iff i,j[ 1,Card J X ]| u i w j =1f( u i )==g( w j ) .

Proof:

By definition of a logical conjunction operation, we have the following a,b[ 0,1 ] , F( a,b )=ab=1a=b=1 . Therefore, from normality of MFs f( u ) and g( w ) from (2.17) ! k * , l * [ 1,Card J X ]! m * |h( v m * )=f( u k * )g( w l * )=1 . In other words, we obtain the case when

m * = k * = l * |h( v )=f( u )=g( w )h( v ) is normal and unimodal. ■

Example 5.

1) The case when fuzzy grades for both input and output are “low”

μ P ( x ) = low = 1/0 + 0.8/.2 + 0.6/.4 + 0.4/.6 + 0.2/.8 + 0/1

μ Q ( x ) = low = 1/0 + 0.8/.2 + 0.6/.4 + 0.4/.6 + 0.2/.8 + 0/1

R( u,w )=( μ P ( x ) μ Q ( x ) )=

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 R( u,w ) is i,j[ 1,Card J X ]

R u i = w j ( u i , w j ) = 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 arehigh

μ P ( x ) = high = 0/0 + 0.2/0.2 + 0.4/0.4 + 0.6/0.6 +0.8/0.8 + 1/1

μ Q ( x ) = high = 0/0 +0.2/0.2 +0.4/0.4 +0.6/0.6 +0.8/0.8 + 1/1

R( u,w )=( μ P ( x ) μ Q ( x ) )=

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 R( u,w ) is i,j[ 1,Card J X ]

R u i = w j ( u i , w j ) = 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 aremiddle

μ P ( x ) = middle = 0.6/0 + 0.8/0.2 + 1/.4 +0.8/0.6 +0.6/0.8 +0.4/1

μ Q ( x ) = middle = 0.6/0 +0.8/0.2 +1/.4 +0.8/0.6 +0.6/0.8 +0.4/1

R( u,w )=( μ P ( x ) μ Q ( x ) )=

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 R( u,w ) is i,j[ 1,Card J X ]

R u i = w j ( u i , w j ) = 0.6/1 + 0.8/1 + 1/1 + 0.8/1 + 0.6/1 + 0.4/1

Corollary 3.

If MFs f( u ) and g( w ) of fuzzy grades of an input μ P ( x ) and an output μ Q ( x ) correspondingly, satisfy conditions (L5.1) - (L5.3) from Lemma 5, but i,j[ 1,Card J   X ] | u i w j =1f( u i )g( w j ) , then MF h( v ) from (L5.3) is subnormal.

Proof:

From (L5.1) and (L5.2) and f( u i )g( w j ) ,| i,j[ 1,Card J X ]| u i w j =1 k * l * , therefore m[ 1,Card J X ] , h( v m )=f( u i )g( w j )<f( u k * )==1 or h( v m )=f( u i )g( w j )<g( w l * )==1 . Hence ! m * |h( v m * )== max m[ 1,Card J X ] { h( v m ) }<1 . ■

Definition 3.

If μ P ( x ) and μ Q ( x ) are two fuzzy grades in J X [ 0,1 ] of FS of type 2, P and Q , respectively, represented as

μ P ( x )= i f( v i ) v i and μ Q ( x )= i g( v i ) v i , v i J X , (3.19)

then we call FS of type 2 Q from (3.19) Semantically Inversive in relation to FS of type 2 P if g( v i )=1f( v i ) , v i J X . In other words we have the following

μ Q ( x )= i 1f( v i ) v i , v i J X (3.20)

Lemma 6.

If a[ 0,1 ]|f( a )=a( 1a )=min( a,1a ) , then f( a )0.5

Proof:

From algebraic definition of a min of two numbers we obtain the following

f( a )=min( a,1a )= a+( 1a )| a( 1a ) | 2 .

Let present f( a ) in the following way f( a )={ f 1 ( a ), a( 1a ) f 2 ( a ), a<( 1a ) .

Thus, we have

f 1 ( a )= 1a+( 1a ) 2 = 22a 2 =1a.

And

f 2 ( a )= 11+2a 2 = 2a 2 =a.

Finally

f( a )={ 1a, a( 1a ) a, a<( 1a ) ={ 1a, 2a1 a, 2a<1 ={ 1a, a0.5 a, a<0.5 ={ 1a, 1a0.5 a, a<0.5

f( a )0.5.

Corollary 4.

Hence, from Lemma 6, if MF h( v )|v J X is an intersection of MFs f( u ) and g( w ) , h( v )=f( u )g( w ) from (3.19) and (3.2), and if it is presented as (L5.3), then it is subnormal and

max m[ 1,Card J X ] { h( v m ) }0.5 . (3.21)

Example 6.

Here is a case of Semantically Inversive fuzzy grades lowand high in use.

4) The case when input fuzzy grade is lowand output one ishigh

μ P ( x ) = low = 1/0 + 0.8/0.2 + 0.6/0.4 + 0.4/0.6 + 0.2/0.8 + 0/1

μ Q ( x ) = high = 0/0 + 0.2/0.2 + 0.4/0.4 + 0.6/0.6 + 0.8/0.8 + 1/1

R( u,w )=( μ P ( x ) μ Q ( x ) )=

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 R( u,w ) is i,j[ 1,Card J X ]

R u i = w j ( u i , w j ) = 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 μ P ( x ) and μ Q ( x ) be two fuzzy grades in J X [ 0,1 ] of FS of type 2, P and Q , represented as a system input (2.12) and an output (2.13) correspondingly. And let an input/output fuzzy relationship matrix be defined as R( u,w )= μ p ( x ) μ Q ( x ) 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 P, P U   and Q, Q W . Note, that μ P ( x ) and μ Q ( x ) are two fuzzy grades in J X [ 0,1 ] of FS of type 2, P and Q from (3.23), represented as a system current input of type

μ P ( x )= i f ( v i ) v i , v i J X μ Q ( x )= i g ( w i ) w i , w i J X . (3.24)

Given a unary relationship R( u )= P one can obtain the consequence R( w ) by Sup-Star Composition to R( u ) and R( u,w ) of type (3.16):

R( w )=R( u )R( u,w )= i f ( u i ) u i i,j ( f( u i )g( w j ) )/ ( u i w j ) = i,j i [ f ( u i ) u i ( f( u i )g( w j ) ) ( u i w j ) ,i,j[ 1,Card J X ] (3.25)

The value of an output fuzzy set Q could be consider as

Q =R( w ) (3.26)

Lemma 7.

Assume that μ P ( x ), μ P ( x ) and μ Q ( x ) are fuzzy grades in J X [ 0,1 ] of FS of type 2; P and Q represent a system input (2.12) and an output (2.13), correspondingly and P represents a system current input (3.24). If an input/output fuzzy relationship matrix is defined as R( u,w )= μ p ( x ) μ Q ( x ) from (3.16), then Sup-Star Composition (3.25) is reduced to the following R( w )=R( u )R( u,w )=R( u ) R u i = w j ( u i , w j ) for i,j[ 1,Card J X ] . Where R u i = w j ( u i , w j ) for i,j[ 1,Card J X ] from (3.18) is the major diagonal of a matrix R( u,w ) .

Proof:

Since R( u,w ) from (3.17) consists of three subsets R u i < w j ( u i , w j ) , R u i = w j ( u i , w j ) and R u i > w j ( u i , w j ) , then from (3.25) we obtain

R( w )= u i < w j i [ f ( u i ) u i ( f( u i )g( w j ) ) ( 1 w j ) u i + u i = w j i [ f ( u i ) u i ( f( u i )g( w j ) ) 1 + u i > w j i [ f ( u i ) u i ( f( u i )g( w j ) ) ( 1 u i ) w j ,i,j[ 1,Card J X ] (3.27)

From (3.27) for meet operator we consider the following three cases for i,j[ 1,Card J X ]

{ f ( u i ) u i ( f( u i )g( w j ) ) ( 1 w j ) u i , u i < w j ; f ( u i ) u i ( f( u i )g( w j ) ) 1 , u i = w j ; f ( u i ) u i ( f( u i )g( w j ) ) ( 1 u i ) w j , u i > w j ;. (3.28)

Note, that for all (3.28) cases the meet operation is realized for involved MFs like h( u i , w j )= f ' ( u i )f( u i )g( w j ) for i,j[ 1,Card J X ] , whereas for values u i , w j J X we have the following

{ v ij = u i ( 1 w j ) u i , u i < w j ; v ij = u i 1, u i = w j ; v ij = u i ( 1 u i ) w j , u i > w j (3.29)

From (3.29), given the result of Corollary 2, ( 1 w j ) u i <0.25| u i < w j and ( 1 u i ) w j <0.25| u i > w j . Hence, v ij <0.25 v ij J X | u i w j , whereas v ij = u i v ij J X | u i = w j and therefore we can rewrite (3.27) as follows i,j[ 1,Card J   X ]

R( w )= u i = w j i [ f ( u i ) u i ( f( u i )g( w j ) ) 1 =R( u ) R u i = w j ( u i , w j )

Example 7.

Let P and Q represent a system input (2.12) and an output (2.13).

Correspondingly, with the following fuzzy grades

μ P ( x ) = 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

μ Q ( x ) = 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

R( u,w )=( μ P ( x ) μ Q ( x ) )=

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 R( u,w ) is i,j[ 1,Card J X ]

R u i = w j ( u i , w j ) = 0.8/1 + 1/1 + 0.8/1 + 0.6/1 + 0.4/1 + 0.2/1

And let a system current input P from (3.24) to be

μ P ( x ) = 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

R( w )=R( u ) R u i = w j ( u i , w j )= μ P ( x ) R u i = w j ( u i , w j )=

(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)

(11)/(0.41)

(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

Q = 0.6/0 + 0.8/0.2 + 1/0.4 + 0.8/0.6 + 0.6/0.8 + 0.4/1 μ Q ( x ) = middle

Example 8.

Here is a case of Semantically Inversive fuzzy grades for input highand output low.

μ P ( x ) = high = 0/0 + 0.2/0.2 + 0.4/0.4 + 0.6/0.6 + 0.8/0.8 + 1/1

μ Q ( x ) = low = 1/0 + 0.8/.2 + 0.6/0.4 +0.4/0.6 +0.2/0.8 +0/1

R( u,w )=( μ P ( x ) μ Q ( x ) )=

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 R( u,w ) is i,j[ 1,Card J X ]

R u i = w j ( u i , w j ) = 0/1 + 0.2/1 + 0.4/1 + 0.4/1+ 0.2/1 + 0/1

And let a system current input P from (3.24) to be

μ P ( x ) = 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

R( w )=R( u ) R u i = w j ( u i , w j )= μ P ( x ) R u i = w j ( u i , w j )=

(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

Q = 0.4/0 + 0.4/0.2 + 0.4/0.4 + 0.4/0.6 + 0.4/0.8 + 0.4/1 μ Q ( x ) = 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, x 1 X 1 , x 2 X 2 ,, x K X K , and one output yY . 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 X 1 × X 2 ×× X K and the output space Y of the FLS. And again, when an input x is applied, the composition of the fuzzy set X ˜ , to which x takes place and the rule R m 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 μ P m ˜ lower ( x ) , then from (L3.1) of Lemma 3 we obtain for K inputs and m rules of FLS the following

j= 1,K ¯ μ P j m ˜ ( x )= j= 1,K ¯ i= 1,Card J X ¯ f j m ( u i ) u i = μ P m ˜ lower ( x ),m[ 1,M ] (3.30)

From (3.7) given (3.30) we are getting for m[ 1,M ]

μ P 1 m ˜ × P 2 m ˜ ×× P K m ˜ Q ˜ m ( x,y ) = j= 1,K ¯ μ P j m ˜ ( x ) μ Q m ˜ ( y )= μ P m ˜ lower ( x ) μ Q m ˜ ( y ) (3.31)

Given that

μ P m ˜ lower ( x )= i= 1,Card J X ¯ f m ( u i lower )/ u i lower

μ Q m ˜ ( y )= j= 1,Card J X ¯ g m ( w j )/ w j

We obtain m[ 1,M ]

μ P m ˜ lower ( x ) μ Q m ˜ ( y )= i,j ( f m ( u i lower ) g m ( w j ) )/ ( u i lower w j ) = u i lower < w j f m ( u i lower ) g m ( w j ) ( 1 w j ) u i lower + u i lower = w j f m ( u i lower ) g m ( w j ) 1 + u i lower > w j f m ( u i lower ) g m ( w j ) ( 1 u i lower ) w j . (3.32)

From (3.17) and (3.32) for each m rule

R m ( u,w )= μ P m ˜ lower ( x ) μ Q m ˜ ( y )= R u i lower < w j m ( u i lower , w j )+ R u i lower = w j m ( u i lower , w j ) + R u i lower > w j m ( u i lower , w j ) (3.33)

Now from (3.32) for each m rule and i,j[ 1,Card J X ] we introduce

h m ( v ij )= f m ( u i lower ) g m ( w j ) (3.34)

From (3.33) and (3.34) we obtain for each m rule

R m ( u,w )= i,j[ 1,Card J X ] h m ( v ij )/ v ij (3.35)

Hence, for i,j[ 1,Card J X ] , whereas for values u i lower , w j J X from (3.35) we have the following

{ v ij =[ ( 1 w j ) u i lower ], u i lower < w j ; v ij =1, u i lower = w j ; v ij =[ ( 1 u i lower ) w j ], u i lower > w j . (3.36)

From (3.36) given the result of Corollary 2

{ v ij 0.25, u i lower < w j ; v ij =1, u i lower = w j ; v ij 0.25, u i lower > w j . (3.37)

Given (3.37) and from the results of Lemma 7 we obtain for each m rule its fuzzy relationship matrix major diagonals

R m ( u,w )= k[ 1,Card J X ] h m ( v k )/1 (3.38)

The knowledge base for m rules of FLS has to be represented as a superposition of all single rules (3.38).

R sup ( u,w )= m[ 1,M ] R m ( u,w )= m[ 1,M ] k[ 1,Card J X ] h m ( v k )/1 = V m[ 1,M ] k[ 1,Card J X ] h m ( v k )/1 = k[ 1,Card J X ] h sup ( v k )/1 (3.39)

Note. The usability of FS R sup ( u,w ) for it use in sup-max composition depends on the question of whether FSs for each m-th rule h m ( v k ) are normal, unimodal and more or less semantically similar.

3.7.2. Decision Making

When an input x is applied with K inputs, x 1 X 1 , x 2 X 2 ,, x K X K . The input space X 1 × X 2 ×× X K is presented with the fuzzy grade

μ P ˜ ( x )= μ P 1 ˜ × P 2 ˜ ×× P K ˜ ( x )= j= 1,K ¯ μ P j ˜ ( x )= μ P ˜ lower ( x ) (3.40)

Given (3.39) and (3.40), the correspondent output space Y will be obtained by using streamlined sup-star composition as the following fuzzy grade

μ Q ˜ ( y )= μ P ˜ lower ( x ) R sup ( u,w ) = i[ 1,Card J X ] f ( u i lower )/ u i lower k[ 1,Card J X ] h sup ( v k )/1

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.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Zadeh, L.A. (1965) Fuzzy Sets. Information and Control, 8, 338-353.[CrossRef]
[2] Zadeh, L.A. (1975) Fuzzy Logic and Approximate Reasoning. Synthese, 30, 407-428.[CrossRef]
[3] Zadeh, L.A. (1975) The Concept of a Linguistic Variable and Its Application to Approximate Reasoning—I. Information Sciences, 8, 199-249.[CrossRef]
[4] Mizumoto, M. and Tanaka, K. (1976) Some Properties of Fuzzy Sets of Type 2. Information and Control, 31, 312-340.[CrossRef]
[5] Yager, R.R. (1980) Fuzzy Subsets of Type II in Decisions. Journal of Cybernetics, 10, 137-159.[CrossRef]
[6] Karnik, N.N., Mendel, J.M. and Qilian Liang, (1999) Type-2 Fuzzy Logic Systems. IEEE Transactions on Fuzzy Systems, 7, 643-658.[CrossRef]
[7] Liang, Q.L. and Mendel, J.M. (2000) Interval Type-2 Fuzzy Logic Systems: Theory and Design. IEEE Transactions on Fuzzy Systems, 8, 535-550.[CrossRef]
[8] Mendel, J.M. and John, R.I.B. (2002) Type-2 Fuzzy Sets Made Simple. IEEE Transactions on Fuzzy Systems, 10, 117-127.[CrossRef]
[9] Tserkovny, A. (2025) Some Linguistic Scaling Issues of Fuzzy Sets Based Decision-Making Systems. Journal of Software Engineering and Applications, 18, 427-445.[CrossRef]
[10] Tserkovny, A. (2017) A t-Norm Fuzzy Logic for Approximate Reasoning. Journal of Software Engineering and Applications, 10, 639-662.[CrossRef]
[11] Fukami, S., Mizumoto, M. and Tanaka, K. (1980) Some Considerations on Fuzzy Conditional Inference. Fuzzy Sets and Systems, 4, 243-273.[CrossRef]

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.