Information Technology Reference
In-Depth Information
μ k i , l j k i , l j ,
if t u =
k i
K
and
v w =
l j
L
P
Q
ρ p r , q s p r , q s ,
if t u =
p r
P
L
K
and
v w =
q s
Q
min
P (
max
k i , l j p r , q s )),
if t u =
k i
K
ϕ t u ,v w t u ,v w =
l j =
p r
L
and
v w =
q s
Q
max
P (
min
k i , l j p r , q s )) ,
l j =
p r
L
0
,
1
,
otherwise
Structural subtraction
T ,
V , { ϕ t u ,v w t u ,v w }] ,
=[
A
B
where
T = (
) ={
t
t
K
P
t u
u
u |
t u
K
P
} ,
V = (
) ={ v w w w | v w
L
Q
L
Q
} ,
for the set-theoretic subtraction operation and
t
k
α
u = α
i ,
for t u =
k i
K
P
,
β w = β
l
j ,
for
v w =
l j
L
Q
and
ϕ t u ,v w t u ,v w = μ k i , l j k i , l j ,
for t u =
k i
K
P and
v w =
l j
L
Q
.
Negation of an EIFIM
T ,
V , μ k i , l j k i , l j }] ,
¬
=[
A
where
is one of the above intuitionistic fuzzy negations in Table 2.1 , or another
possible negation.
¬
Termwise subtraction
A
max , min B
=
A
max , min ¬
B
,
min , max B
=
min , max ¬
.
A
A
B
Search WWH ::




Custom Search