Next Article in Journal
Approximate Closed-Form Solutions for the Rabinovich System via the Optimal Auxiliary Functions Method
Next Article in Special Issue
SPM: Sparse Persistent Memory Attention-Based Model for Network Traffic Prediction
Previous Article in Journal
Some New Bennett–Leindler Type Inequalities via Conformable Fractional Nabla Calculus
Previous Article in Special Issue
A Heuristic Integrated Scheduling Algorithm via Processing Characteristics of Various Machines
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fuzzy Reasoning for Mixture of Fuzzy/Intuitionistic Fuzzy Information Based on Triple I Method

1
School of Mathematics and Statistics, Shaanxi Normal University, Xi’an 710062, China
2
College of Science, Xi’an University of Science and Technology, Xi’an 710054, China
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(10), 2184; https://doi.org/10.3390/sym14102184
Submission received: 16 September 2022 / Revised: 28 September 2022 / Accepted: 8 October 2022 / Published: 18 October 2022
(This article belongs to the Special Issue Symmetry/Asymmetry and Fuzzy Systems)

Abstract

:
Generalized modus ponens (GMP) is a basic model of approximate reasoning. GMP in fuzzy propositions is called fuzzy modus ponen (FMP) and it is called intuitionistic fuzzy modus ponens (IFMP) when fuzzy propositions are generalized to intuitionistic fuzzy propositions. In this paper, we aim to investigate fuzzy reasoning methods for GMP with mixture of fuzzy/intuitionistic fuzzy information. For mixed types of GMP, we present two basic methods to solve GMP problems based on the triple I method (TIM). One is to transform the GMP problem into two FMP problems by decomposition and aggregate the solutions of TIM for FMP problems to obtain the solution for GMP problem. The other is to transform the GMP problem into the IFMP problem by expansion and aggregate the solutions of TIM for the IFMP problem to obtain the solution for the GMP problem. These two methods are called the decomposition triple I method (DTIM) and expansion triple I method (ETIM), respectively. We analyze the relationship between DTIM and ETIM. Furthermore, we discuss the reversibility of DTIM and ETIM.

1. Introduction

Since the concept of fuzzy sets (FSs) proposed by Zadeh [1] is quite powerful in expressing and dealing with imprecise and uncertain information, there are fruitful research results both in theory and application. It is well known that fuzzy modus ponens (FMP) and fuzzy modus tollens (FMT) are the two basic inference models of fuzzy approximate reasoning. The composition rule of inference (CRI) introduced by Zadeh [2] is a very widespread and important reasoning principle for the basic models FMP and FMT.
Although the CRI of approximate reasoning has been successfully applied in many fields [3,4,5,6], it should be admitted that CRI method lacks a logical foundation as Wang pointed out in [7]. Wang proposed the triple I method (TIM) to provide a logical principle of reasonableness for fuzzy inference [7,8]. TIM soon attracted the attention of researchers and became an significant method to deal with the issues related to FMP and FMT [8,9,10,11,12,13,14,15,16,17,18]. Liu and Wang [9] studied the properties of TIM concerning sustaining degrees. Pei [11] proposed a first order logic deduce system based on the unified TIM. Tang generalized TIM to the symmetric implication method in [13] and advanced a novel symmetric implication method on the strength of two-dimensional sustaining degree [14]. Zhou gave a new solution formula of TIM based on law of importation and flexible ordering property in [18].
The concept of interval valued fuzzy sets (IVFSs) presented by Zadeh [19] is a generalization of fuzzy sets. It generalizes the membership degree from a singleton to an interval in the unit interval, which represent unknown or ill-known information. The concept of intuitionistic fuzzy sets (IFSs) proposed by Atanassov [20] is another generalization of fuzzy sets. It is given by a pair of fuzzy sets, which provides the membership degree and the non-membership degree, respectively. They represent validity and falsity of the given information. IVFSs and IFSs are isomorphic in math, but their motivations and circumstances are different. They provide more possible semantic interpretations for uncertain information, so the theory of IFSs has been applied in wide fields, such as approximate reasoning, decision making, clustering analysis, data mining, and so on [21,22,23,24,25,26,27,28].
IFMP (intuitionistic fuzzy modus ponens) and IFMT ( (intuitionistic fuzzy modus tollens) are the extensions of FMP and FMT in the intuitionistic fuzzy environment, respectively. The essential principles of the CRI method and TIM have been used to solve IFMP and IFMT problems of intuitionistic fuzzy reasoning. The CRI method for intuitionistic fuzzy reasoning was explored in [29]. Zheng et al. [30] extended TIM for intuitionistic fuzzy reasoning and explored the reversibility of TIM for IFMP and IFMT. Concerning the issue on the deficiency of reversibility for TIM in IFMT, Liu and Zheng [31] presented a dual approximate reasoning method of TIM for IFMT. Zheng and Liu [32] advanced TIM for multiple-rules systems with intuitionistic fuzzy information.
For FMP and IFMP problems, the reasoning models coincide as follows:
        Given If u i s P then v i s Q major premise         input u i s P * minor premise output             v i s Q * conclusion
The fuzzy propositions are represented by the fuzzy sets. The type of sets P , P * , Q , Q * is unitary, i.e., they are all FSs and IFSs in FMP and IFMP, respectively. In the process of fuzzy inference, “if-then” rule can be identified as a fuzzy implication operator and an intuitionistic fuzzy implication operator in FMP and IFMP, respectively.
That is to say, model (1) can be considered as a generalized modus ponens (GMP) model. The solution Q * is determined by the information P , Q , P * . In fact, the real world is full of all kinds of information, even heterogeneous information. Moreover, the variability of information will lead to confounding of inference rules. How can we represent the mechanism of our reasoning and decision-making in a mixed information environment? It is always a very valuable and challenging topic. Our motivation is to explore fuzzy reasoning in a kind of mixed information environment under the frame of GMP.
From the perspective of information diversity, we suppose that P , Q , P * are alternative in fuzzy sets or intuitionistic fuzzy sets separately rather than simultaneously. Obviously, by listing all possible types of P , Q , P * we can obtain eight possibilities, according to Table 1 (F denotes fuzzy set, IF denotes intuitionistic fuzzy set).
As can be seen in Table 1, type 1 of GMP is FMP and type 2 of GMP is IFMP. In these two cases, the former P and the rear Q coincide in the type of information, as well as the two formers P and P * . In type 3 and type 4 of GMP, the former P and the rear Q coincide, but the two formers P and P * do not. In type 5 and type 6 of GMP, the two formers P and P * coincide, but the former P and the rear Q do not. In type 7 and type 8 of GMP, the former P and the rear Q do not coincide, neither do the two formers P and P * . The aim of our paper is how to obtain the solutions of the rest six types of GMP by selecting the solving models based on basic models FMP and IFMP.

2. Preliminaries

Here we review the main concepts and results, which are necessary for our subsequent developments.
Definition 1
([33]). A t-norm is a binary operation : [ 0 , 1 ] 2 [ 0 , 1 ] such that is commutative, associative, monotonic and has the identity 1. A t-conorm is a binary operation : [ 0 , 1 ] 2 [ 0 , 1 ] such that is commutative, associative, monotonic, and has the identity 0.
A pair ( , ) is called a dual pair of t-norm and t-conorm if x y = 1 ( 1 x ) ( 1 y ) , x , y [ 0 , 1 ] . Analogously, x y = 1 ( 1 x ) ( 1 y ) .
Definition 2
([8,30,33]). Let , be two binary operation on [0,1], ( , ) is called an adjoint pair if the residual principle holds
x y z i f f x y z , x , y , z [ 0 , 1 ]
is called the residuum of .
Let , be a two binary operation on [0,1], ( , ) is called a co-adjoint pair if the co-residual principle holds,
x y z i f f x z y , x , y , z [ 0 , 1 ]
is called the residuum of .
Proposition 1
([8,33]). If is a left-continuous t-norm then the residuum → of is derived from
x y = { z [ 0 , 1 ] z x y }
and → is called a residual implication (R-implication) induced by .
Proposition 2
([30,31]). If is a right-continuous t-conorm, then the co-residuum of is derived from
x y = { z [ 0 , 1 ] x z y }
and is called fuzzy difference operator induced by .
Theorem 1
([10]). Let → be an R-implication induced by a left-continuous t-norm in FMP, then the solution Q * of TIM for FMP is given by the following formula
Q * ( v ) = u U { P * ( u ) ( P ( u ) Q ( v ) ) } , v V
Definition 3
([20]). An intuitionistic fuzzy set A is given by two functions
A t , A f : U [ 0 , 1 ]
which satisfy the condition
0 A t ( u ) + A f ( u ) 1 , u U
A t ( u ) and A f ( u ) , respectively, denote the degree of membership and the degree of non-membership of the element u to the set A. An intuitionistic fuzzy set A on the nonempty universe U can be denoted as
A = { < u , A t ( u ) , A f ( u ) > | u U }
The set of all fuzzy subsets/intuitionistic fuzzy subsets on U is denoted as F ( U ) / I F ( U )
As a generalization of FSs, IFSs extend the range of character value from [0, 1] to the triangle domain D * = { ( x , y ) [ 0 , 1 ] 2 | x + y 1 } . Let A t ( u ) = 1 A t ( u ) , A f ( u ) = 1 A f ( u ) , u U , then IFSs degenerate into FSs if and only if A t ( u ) = A f ( u ) if and only if A f ( u ) = A t ( u ) .
A partial order on D * can be defined as follows
a , b D * , a = ( a 1 , a 2 ) , b = ( b 1 , b 2 ) , a b if and only if a 1 b 1 , a 2 b 2 .
Obviously, a b = ( a 1 b 1 , a 2 b 2 ) , a b = ( a 1 b 1 , a 2 b 2 ) . Denote 0 * = ( 0 , 1 ) and 1 * = ( 1 , 0 ) . 0 * and 1 * are the bottom element and the top element of D * , respectively. ( D * , ) is a complete lattice.
Denote a = ( a 1 , 1 a 1 ) , a = ( 1 a 2 , a 2 ) . , are called the necessity operator and the possibility operator in D * , respectively [21]. These two operators convert intuitionistic fuzzy numbers into fuzzy numbers.
If we denote an intuitionistic fuzzy set A = ( A t , A f ) for short, then A = ( A t , 1 A t ) = ( A t , A t ) , A = ( 1 A f , A f ) = ( A f , A f ) . It is easy to find that the IFSs A , A degenerate into FSs, i.e., A = A t , A = A f . Obviously, A A A .
Definition 4
([30]).  D * is called an intuitionistic t-norm induced by t-norm if
a D * b = ( a 1 b 1 , a 2 b 2 )
D * is called an intuitionistic t-conorm induced by t-norm if
a D * b = ( a 1 b 1 , a 2 b 2 )
where is the dual t-conorm of the t-norm .
Theorem 2
([30]). Let D * be an intuitionistic t-norm induced by a left-continuous t-norm , then there exists a binary operation D * on D * satisfying the residual principle, i.e.,
c D * a b i f f c a D * b
and D * is given by
a D * b = { d D * | d D * a b }
Definition 5
([30]).  ( D * , D * ) is called an intuitionistic adjoint pair if ( D * , D * ) satisfy (2.6) and D * is called an intuitionistic R-implication if D * is an intuitionistic t-norm induced by a left-continuous .
Theorem 3
([30]). Let a , b D * , a = ( a 1 , a 2 ) , b = ( b 1 , b 2 ) , D * be an intuitionistic t-norm induced by a left-continuous t-norm , then
a D * b = ( ( a 1 b 1 ) ( 1 b 2 a 2 ) , b 2 a 2 )
Theorem 4
([30]). Let D * be an intuitionistic R-implication in IFMP, then the solution Q * of TIM for IFMP is given by the following formula
Q * ( v ) = u U { P * ( u ) D * ( P ( u ) D * Q ( v ) ) } , v V
Corollary 1
([30]). Let D * be an intuitionistic R-implication in IFMP, then the triple I solution Q * ( v ) = ( Q t * ( v ) , Q f * ( v ) ) where
Q t * ( v ) = x U { P t * ( u ) ( ( P t ( u ) Q t ( v ) ) ( P f ( u ) Q f ( v ) ) ) } Q f * ( v ) = u U { P f * ( u ) ( 1 P f ( u ) Q f ( v ) ) }

3. Solving Type 3 and Type 4 of GMP Based on the Principle of Major Premise Precedence

The basic character of type 3 and type 4 of GMP is that the former P and the rear Q coincide as information type in the major premise. It is a natural ideal that the selected solving model should be either FMP or IFMP according to the condition that P , Q are either FSs or IFSs—this is called the principle of major premise precedence.

3.1. Decomposition Triple I Method (DTIM) for Solving Type 3 of GMP

In this subsection, we consider inference methods of type 3 of GMP. The inference model is as follows:
        Given If u i s P then v i s Q major premise         input u i s P * minor premise output             v i s Q * conclusion
where P F ( U ) , Q F ( V ) , P * I F ( U ) , u U , v V . Q * , as unknown information, is either a fuzzy set or an intuitionistic fuzzy set.
Because P and Q are FSs, “if-then” rule can be taken as fuzzy inference. We should solve Q * by converting the intuitionistic fuzzy set P * into fuzzy sets based on fuzzy inference model FMP. We denote
P * = ( P t * , 1 P t * ) = ( P t * , P t * ) , P * = ( 1 P f * , P f * ) = ( P f * , P f * ) .
Obviously, P * = P t * , P * = P f * . P * P * P * .
Therefore, firstly, we decompose the model (12) to two FMP models in which P t * , P f * are the formers, respectively. Secondly, we obtain the solutions of FMP problems by TIM. Finally, we aggregate the two solutions to obtain Q * .
Step1: We decompose the model (12) into two FMP models as follows:
Given P ( u ) Q ( v ) input P t * ( u ) output Q 1 * ( v )
Given P ( u ) Q ( v ) input P f * ( u ) output Q 2 * ( v )
where → is an R-implication.
Step2: We use TIM to solve the models (13) and (14), respectively. According to Theorem 1, we obtain the solutions as follows:
Q 1 * ( v ) = u U { P t * ( u ) ( P ( u ) Q ( v ) ) }
Q 2 * ( v ) = u U { P f * ( u ) ( P ( u ) Q ( v ) ) }
Since P t * ( u ) + P f * ( u ) 1 , i.e., P t * ( u ) P f * ( u ) , u U , it follows from the properties of fuzzy operators that, Q 1 * ( v ) Q 2 * ( v ) , v V . Now, we obtain the solutions Q 1 * , Q 2 * of model (13) and model (14), respectively. How can we obtain the solutions Q * of model (12) from Q 1 * , Q 2 * ? The core of the question is which information type of Q * it is. Obviously, it depends on what kind of information type of Q * we want to obtain. So we have two choices, either a fuzzy set or an intuitionistic fuzzy set.
Step3: Presenting the solution Q * of model (12).
Case1: If we suppose that Q * F ( V ) , then it is reasonable that any Q * [ Q 1 * , Q 2 * ] can be the solution of model (12).
Case2: If we suppose that Q * I F ( V ) , then we can aggregate Q 1 * , Q 2 * to be the following intuitionistic fuzzy set as the solution of model (12).
Q * = ( Q 1 * , 1 Q 2 * )
Example 1.
Let U = { u 1 , u 2 , u 3 } , V = { v 1 , v 2 , v 3 }
P = { < u 1 , 0.5 > , < u 2 , 0.7 > , < u 3 , 0.9 > } ,
Q = { < v 1 , 0.6 > , < v 2 , 0.8 > , < v 3 , 0.7 > } ,
P * = { < u 1 , 0.6 , 0.3 > , < u 2 , 0.5 , 0.2 > , < u 3 , 0.8 , 0.1 > } ,
, D * are R-implications induced by Lukasiewicz t-norm L u . Now we derive the solution Q * of type 3 GMP by DTIM.
x , y [ 0 , 1 ] , x Lu y = ( x + y 1 ) 0 , x Lu y = ( 1 x + y ) 1
It follows from
Q 1 * ( v ) = u U { P t * ( u ) ( P ( u ) Q ( v ) ) }
that
Q 1 * ( v 1 ) = u U { P t * ( u ) ( P ( u ) Q ( v 1 ) ) } = 0.6
Q 1 * ( v 2 ) = u U { P t * ( u ) ( P ( u ) Q ( v 2 ) ) } = 0.7
Q 1 * ( v 3 ) = u U { P t * ( u ) ( P ( u ) Q ( v 3 ) ) } = 0.6
Thus, Q 1 * = { < v 1 , 0.6 > , < v 2 , 0.7 > , < v 3 , 0.6 > }
Similarly, Q 2 * = { < v 1 , 0.7 > , < v 2 , 0.8 > , < v 3 , 0.8 > }
Therefore, if Q * is a fuzzy set, then Q * [ Q 1 * , Q 2 * ] . That is, the membership degree of v 1 , v 2 , v 3 is a value in interval [0.6, 0.7], [0.7, 0.8], and [0.6, 0.8], respectively. If Q * is an intuitionistic fuzzy set, then Q * = ( Q 1 * , 1 Q 2 * ) , i.e.,
Q * = { < v 1 , 0.6 , 0.3 > , < v 2 , 0.7 , 0.2 > , < v 3 , 0.6 , 0.2 > }

3.2. Expansion Triple I Method (ETIM) for Solving Type 4 of GMP

The solving method of type 4 GMP is similar to that of type 3. The model of type 4 is as follows:
        Given If u i s P then v i s Q major premise         input u i s P * minor premise output             v i s Q * conclusion
where P I F ( U ) , Q I F ( V ) , P * F ( U ) , u U , v V . Denote P = ( P t , P f ) , Q = ( Q t , Q f ) .
“If-then” rule could be taken as an intuitionistic fuzzy implication relation because P , Q are IFSs. The fuzzy set P * as a degenerated intuitionistic fuzzy set, can be denoted as P * = ( P * , 1 P * ) . Based on the principle of major premise precedence, we could transform the model (15) into an IFMP model to obtain the solution by TIM of intuitionistic fuzzy reasoning.
Step1: The model (15) is transformed into the following IFMP model:
Given P ( u ) D * Q ( v ) input P * ( u ) output Q * ( v )
where P = ( P t , P f ) , Q = ( Q t , Q f ) , P * = ( P * , 1 P * ) , Q * = ( Q t * , Q f * ) , and D * is an intuitionistic R-implication.
Step2: Solving the model (16). Since the model (16) is an IFMP problem, we can obtain the output Q * ( v ) = ( Q t * ( v ) , Q f * ( v ) ) by TIM. According to Corollary 1
Q t * ( v ) = ( u U { P * ( u ) ( P t ( u ) Q t ( v ) ) ( P f ( u ) Q f ( v ) ) } Q f * ( v ) = u U { ( 1 P * ( u ) ( 1 P f ( u ) Q f ( v ) ) } = 1 u U { P * ( u ) ( P f ( u ) Q f ( v ) ) }
Step3: Presenting the solution Q * of model (15). As we explain in the previous subsection, the form of Q * depends on the type of solution we want.
Case1: If we suppose that Q * I F ( V ) , then Q * = Q * .
Case2: If we suppose that Q * F ( V ) , then Q * [ Q t * , 1 Q f * ] .
Example 2.
Let U = { u 1 , u 2 , u 3 } , V = { v 1 , v 2 , v 3 }
P = { < u 1 , 0.5 , 0.3 > , < u 2 , 0.7 , 0.2 > , < u 3 , 0.9 , 0.1 > } ,
Q = { < v 1 , 0.6 , 0.2 > , < v 2 , 0.8 , 0.1 > , < v 3 , 0.6 , 0.3 > } ,
P * = { < u 1 , 0.6 > , < u 2 , 0.7 > , < u 3 , 0.9 > } ,
, D * are R-implications induced by Lukasiewicz t-norm L u . Now, we derive the solution Q * of type 4 GMP by ETIM.
It follows from
Q t * ( v ) = u U { P * ( u ) ( ( P t ( u ) Q t ( v ) ) ( P f ( u ) Q f ( v ) ) ) }
that Q t * ( v 1 ) = 0.6 , Q t * ( v 2 ) = 0.8 , Q t * ( v 3 ) = 0.6 . Thus
Q t * = { < v 1 , 0.6 > , < v 2 , 0.8 > , < v 3 , 0.6 > } .
Similarly, Q f * = { < v 1 , 0.2 > , < v 2 , 0.1 > , < v 3 , 0.3 > } .
Therefore, if Q * is an intuitionistic fuzzy set, then
Q * = ( Q t * , Q f * ) = { < v 1 , 0.6 , 0.2 > , < v 2 , 0.8 , 0.1 > , < v 3 , 0.6 , 0.3 > } .
If Q * is a fuzzy set, then Q * [ Q t * , Q f * ] . That is, the membership degree of v 1 , v 2 , v 3 is a value in interval [0.6, 0.8], [0.8, 0.9], and [0.6, 0.7], respectively.

4. Two Basic Methods for Solving Type 3 and Type 4 of GMP Again

It is reasonable to adopt different methods to solve the type 3 and type 4 of GMP models based on the principle of major premise precedence. In fact, the decomposition method and expansion method reflect two basic ideas of transformation to deal with mixed information models of GMP. So these two basic methods can be used to solve any model in type 3–8 of the GMP models.

4.1. ETIM for Solving Type 3 of GMP

In this subsection, we will approach the type 3 of GMP again by the expansion method. If we take this method, then we should take the fuzzy sets P and Q in model (12) as the degenerated intuitionistic fuzzy sets. The model (12) is transformed into the following IFMP model:
  Given P ( u ) D * Q ( v )   input P * ( u ) output Q * ( v )
where P = ( P t , P f ) = ( P , 1 P ) , Q = ( Q t , Q f ) = ( Q , 1 Q ) , P * = ( P t * , P f * ) , Q * = ( Q t * , Q f * ) . Obviously, P t = P , P f = P , Q t = Q , Q f = Q
According to Corollary 1, we obtain that
Q t * ( v ) = u U { P t * ( u ) ( ( P t ( u ) Q t ( v ) ) ( P f ( u ) Q f ( v ) ) ) } = u U { P t * ( u ) ( P ( u ) Q ( v ) ) } Q f * ( v ) = u U { P f * ( u ) ( 1 ( P f ( u ) Q f ( v ) ) ) } = u U { P f * ( u ) ( 1 ( P ( u ) Q ( v ) ) ) } Q f * ( v ) = u U { P f * ( u ) ( P ( u ) Q ( v ) ) }
It is easy to obtain the output Q * of model (17). The solution Q * of model (12) is consequently derived from Q * .
If Q * I F ( V ) , then Q * = Q * .
If Q * F ( V ) , then Q * [ Q t * , 1 Q f * ] = [ Q t * , Q f * ] .
Comparing the solution of ETIM with the solution of DTIM for the type 3 of GMP, we can find the following conclusion.
Theorem 5.
ETIM is equivalent to DTIM for model (12).

4.2. DTIM for Solving Type 4 of GMP

The major premise of type 4 of GMP can be represented as an intuitionistic fuzzy proposition “ P ( u ) D * Q ( v ) ” where P = ( P t , P f ) , Q = ( Q t , Q f ) . How could we transfer model (15) of type 4 into FMP problems when the minor premise is a fuzzy proposition? In fact, Formula (9) explicates the relationship between intuitionistic fuzzy implication and fuzzy operators, so the argument formula of the triple I solution for IFMP is represented by Formula (11). According to Formula (11), a decomposition method for IFMP is proposed in the paper [34]. Naturally, Formula (11) also tells us the approach of transformation.
The model (15) is transformed into the two following FMP problems:
Given P t ( u ) Q t ( v ) input P * ( u ) output Q 1 * ( v )
Given P f ( u ) Q f ( v ) input P * ( u ) output Q 2 * ( v )
According to Theorem 1, we obtain
Q 1 * ( v ) = u U { P * ( u ) ( P t ( u ) Q t ( v ) ) }
Q 2 * ( v ) = u U { P * ( u ) ( P f ( u ) Q f ( v ) ) }
If Q * F ( V ) , then it is appropriate that Q * = Q 1 * Q 2 * considering the condition that Q 1 * and Q 2 * do not constitute a partial order relation in the sense of fuzzy sets. If Q * I F ( V ) , we can obtain Q * = ( Q 1 * Q 2 * , 1 Q 2 * ) by aggregating Q 1 * , Q 2 * .

5. Relationship between DTIM and ETIM

For the types 3 and 4 of GMP, we show the concrete solution steps and obtain their solution by using DTIM and ETIM, respectively, in Section 3 and Section 4. It is similar to obtaining the solutions of type 5–8 of GMP by DTIM and ETIM. According to the results of Section 3 and Section 4, we could provide the following tables (Table 2 and Table 3) to show their solutions for types 3–4 of GMP, and do so for types 5–8 of GMP (Table 4, Table 5, Table 6 and Table 7).
Remark 1.
For each type of GMP, the solutions Q 1 * , Q 2 * of DTIM and the solutions Q t * , Q f * , Q f * of ETIM are derived from Formula (4) and Formula (11), respectively. Different types can lead to differences in formula form. In Section 3 and Section 4, we have a specific interpretation to how to obtain the form of these solutions for type 3 and type 4 of GMP. Once we have properly represented the information P , Q , P * in the different types of model, the process of obtaining the solutions of the remaining types (types 3–8) GMP is trivial. In the calculation of some formulas, we need to use the results of preliminaries and the properties of fuzzy operators. These details are also trivial.
Theorem 6.
DTIM is equivalent to ETIM for the mixed types of GMP models if P is a fuzzy set.
Proof. 
In fact, the mixed types of GMP are type 3–8 of GMP. If P is a fuzzy set, they are type 3, 5, and 7 of GMP. It is valid for type 3 of GMP from Theorem 5 and types 5 and 7 of GMP from Table 4 and Table 5. □
Remark 2.
Obviously, DTIM is not equivalent to ETIM when P I F ( V ) , but the intuitionistic fuzzy solution Q * of DTIM is equivalent to that of ETIM for types 4 and 8 of GMP. From Table 2, Table 3, Table 4, Table 5, Table 6 and Table 7, we can find that the second argument of intuitionistic fuzzy solution Q * by DTIM is equal to that by ETIM for all types of GMP. That is, the second argument of intuitionistic fuzzy solution has invariance property by the two basic methods for all types of GMP.
Figure 1 shows the core process of solving the mixture type of GMP problem by DTIM and ETIM.

6. Reversibility of DTIM and ETIM

As we all know, the reversibility of inference methods is an important issue in fuzzy reasoning. The TIM of FMP and IFMP is reversible. It is interesting to explore whether DTIM and ETIM satisfy the reversibility, i.e., P * = P implies Q * = Q .
Definition 6.
In FMP/IFMP, a method is called C-reversible if P * = P implies Q * = Q whenever condition (C) is satisfied.
In particular, if the condition (C) is: P is normal, i.e., u 0 such that P ( u 0 ) = 1 ( o r P ( u 0 ) = 1 * ) then the prefix C- can be omitted. TIM possesses virtue of reversibility compared with CRI.
Theorem 7
([8,30]). TIM of FMP/IFMP is reversible, i.e., Q * = Q whenever P * = P is normal.
Corollary 2.
If there exists u 0 such that P ( u 0 ) = 1 , then
u U { P ( u ) ( P ( u ) Q ( v ) ) = Q ( v ) , v V
In any mixed type of GMP, we provide the two alternatives for Q * , a fuzzy set or an intuitionistic fuzzy set. When we mention the reversibility of a method to solve a mixed type of GMP, it means that an alternative Q * satisfies Q * = Q if P * = P . Of course, we realize that the assumption P * = P is not always satisfied. When P F ( U ) , P * I F ( U ) , the assumption can be satisfied, but in the reverse, when P I F ( U ) , P * F ( U ) , the assumption can not be guaranteed. Types 3–8 of GMP are concerned except type 4 and type 8.
Theorem 8.
For types 3, 5, and 7 of GMP, DTIM and ETIM are reversible, i.e., Q * = Q whenever P * = P is normal.
Proof. 
In types 3, 5, and 7 of GMP, P is a fuzzy set. According to Theorem 6, DTIM is equivalent to ETIM for these types of GMP. So we only need prove that DTIM is reversible. By DTIM, type 3 of GMP is transformed into two FMP problems and the two solutions of FMP problems are given, respectively, as follows,
Q 1 * ( v ) = u U { P t * ( u ) ( P ( u ) Q ( v ) ) }
Q 2 * ( v ) = u U { P f * ( u ) ( P ( u ) Q ( v ) ) }
If P * = P , i.e., ( P t * , P f * ) = ( P , 1 P ) , then P t * = P , P f * = P . P is normal, i.e., u 0 such that P ( u 0 ) = 1 , so
Q 1 * = u U { P ( u ) ( P ( u ) Q ( v ) ) = Q
Q 2 * = u U { P ( u ) ( P ( u ) Q ( v ) ) = Q
Therefore, if Q * is a fuzzy set, then Q * = Q . Meanwhile, if Q * is an intuitionistic fuzzy set, then Q * = ( Q , 1 Q ) = Q . The proof for type 3 of GMP is completed. It is similar for types 5 and 7 of GMP. □
Theorem 9.
For type 6 of GMP, DTIM and ETIM are reversible, i.e., Q * = Q whenever P * = P is normal.
Proof. 
In type 6 of GMP, P and P * are intuitionistic fuzzy sets and Q is a fuzzy set. Put P = ( P t , P f ) , P * = ( P t * , P f * ) . By DTIM, we obtain
Q 1 * ( v ) = u U { P t * ( u ) ( P t ( u ) Q ( v ) ) }
Q 2 * ( v ) = u U { P f * ( u ) ( P f ( u ) Q ( v ) ) }
Since P * = P is normal, we obtain
Q 1 * = u U { P ( u ) ( P ( u ) Q ( v ) ) = Q
Q 2 * = u U { P ( u ) ( P ( u ) Q ( v ) ) = Q
Therefore, if Q * is a fuzzy set, then Q * = Q . Thus, DTIM is reversible.
By ETIM,
Q t * ( v ) = u U { P t * ( u ) ( P f ( u ) Q ( v ) ) }
Q f * ( v ) = u U { P f * ( u ) ( P f ( u ) Q ( v ) ) }
Obviously, when P * = P , i.e., ( P t * , P f * ) = ( P t , P f ) and P is normal,
Q f * ( v ) = u U { P f ( u ) ( P f ( u ) Q ( v ) ) = Q ( v )
Q t * ( v ) = u U { P t ( u ) ( P f ( u ) Q ( v ) ) } u U { P f ( u ) ( P f ( u ) Q ( v ) ) } = Q ( v ) )
P is normal. It is said that there exists u 0 such that P ( u 0 ) = 1 , i.e., P t ( u 0 ) = 1 , P f ( u 0 ) = 0 , P f ( u 0 ) = 1 . It follows from
Q t * ( v ) = u U { P t * ( u ) ( P f ( u ) Q ( v ) ) }
that
Q t * ( v ) 1 ( 1 Q ( v ) ) = Q ( v )
So Q t * = Q . Therefore, if Q * is a fuzzy set, then Q * = Q . Thus, ETIM is also reversible. □

7. Conclusions

FMP and IFMP are the two representations of GMP in the fuzzy environment and intuitionistic fuzzy environment, respectively. They are basic and important problems in fuzzy reasoning. For a mix of fuzzy/intuitionistic fuzzy information, we discussed six mixed types of GMP in this paper. Based on TIM, we took two basic transformation patterns—decomposition and expansion—to solve each mixed type of GMP problem. By DTIM and ETIM, we transformed a mixed type of GMP problem into FMP problems and IFMP problems, respectively, gave the corresponding triple I solutions of FMP problems and IFMP problems, and composited these solutions to obtain the solution of the GMP problem. We obtained the solutions of DTIM and ETIM for six mixed types of GMP and presented the equivalence between DTIM and ETIM. Moreover, we investigated the reversibility of DTIM and ETIM and found that DTIM and ETIM were reversible except for types 4 and 8 of GMP. Our research proposes methods for fuzzy reasoning with specific types of mixed information. We are looking forward to this work supporting and aiding the wider application of fuzzy reasoning.
In the future, we will focus on the following issues: (1) It is interesting and valuable to generalize our methods or explore a novel method for the mixture of more general and complex fuzzy information. (2) The triple I method based on the flexible ordering property was proposed in [18]. The performance of DTIM and ETIM with the flexible ordering property deserves further study.

Author Contributions

Conceptualization, M.Z. and Y.L.; Formal analysis, M.Z.; Methodology, M.Z. and Y.L.; Supervision, Y.L.; Writing—original draft, M.Z.; Writing—review & editing, M.Z. and Y.L. All authors have read and agreed to the published version of the manuscript.

Funding

Natural Science Foundation of China (Nos. 12171292; 12171293).

Data Availability Statement

Not applicable.

Acknowledgments

This work has been supported by the Natural Science Foundation of China (Nos. 12171292; 12171293). The authors would like to thank the anonymous reviewers and editors for suggesting improvements for the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy Sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Zadeh, L.A. Outline of a new approach to the analysis of complex systems and decision processes. IEEE Trans. Syst. Man Cybern. 1973, 3, 28–44. [Google Scholar] [CrossRef] [Green Version]
  3. Mamdani, E.H.; Gaines, B.R. Fuzzy Reasoning and Its Applications; Academic Press: London, UK, 1981. [Google Scholar]
  4. Lee, C.C. Fuzzy logic in control systems: Fuzzy logic controller. IEEE Trans. Syst. Man Cybern. 1990, 20, 405–435. [Google Scholar] [CrossRef] [Green Version]
  5. Wang, L.X. A Course in Fuzzy Systems and Control; Prentice Hall PTR: Upper Saddle River, NJ, USA, 1997. [Google Scholar]
  6. Kahraman, C. (Ed.) Fuzzy Applications in Industrial Engineering; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  7. Wang, G.J. Full implicational triple I Method for fuzzy reasoning. Sci. China (Ser. E) 1999, 29, 43–53. [Google Scholar]
  8. Wang, G.J. Non-classical Mathematical Logic and Approximate Reasoning, 2nd ed.; Science Press: Beijing, China, 2008. (In Chinese) [Google Scholar]
  9. Liu, H.W.; Wang, G.J. Unified forms of fully implicational restriction methods for fuzzy reasoning. Inf. Sci. 2007, 177, 956–966. [Google Scholar] [CrossRef]
  10. Pei, D.W. Unified full implication algorithms of fuzzy reasoning. Inf. Sci. 2008, 178, 520–530. [Google Scholar] [CrossRef]
  11. Pei, D.W. Formalization of implication based fuzzy reasoning method. Int. J. Approx. Reason. 2012, 53, 837–846. [Google Scholar] [CrossRef] [Green Version]
  12. Tang, Y.M.; Liu, X.P. Differently implicational universal triple I method of (1,2,2) type. Comput. Math. Appl. 2010, 59, 1965–1984. [Google Scholar] [CrossRef] [Green Version]
  13. Tang, Y.M.; Yang, X.Z. Symmetric implicational method of fuzzy reasoning. Int. J. Approx. Reason. 2013, 54, 1034–1048. [Google Scholar] [CrossRef]
  14. Tang, Y.M.; Pedrycz, W. On the α(u,v)-symmetric implicational method for R- and (S,N)-implications. Int. J. Approx. Reason. 2018, 92, 212–231. [Google Scholar] [CrossRef]
  15. Wang, G.J.; Duan, J.Y. On robustness of the full implication triple I inference method with respect to finer measurements. Int. J. Approx. Reason. 2014, 55, 787–796. [Google Scholar] [CrossRef]
  16. Luo, M.X.; Zhou, X.L. Robustness of reverse triple I algorithms based on interval-valued fuzzy inference. Int. J. Approx. Reason. 2015, 66, 16–26. [Google Scholar] [CrossRef]
  17. Luo, M.X.; Liu, B. Robustness of interval-valued fuzzy inference triple I algorithms based on normalized Minkowski distance. J. Log. Algebraic Methods Programm. 2017, 86, 298–307. [Google Scholar] [CrossRef]
  18. Zhou, H.J. Characterizations and Applications of Fuzzy Implications Generated by a Pair of Generators of T-Norms and the Usual Addition of Real Numbers. IEEE Trans. Fuzzy Syst. 2022, 30, 1952–1966. [Google Scholar] [CrossRef]
  19. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning I. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  20. Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  21. Atanassov, K. Intuitionistic Fuzzy Sets: Theory and Applications; Physica-Verlag: Heidelberg, Germany, 1999. [Google Scholar]
  22. Atanassov, K. Intuitionistic fuzzy logics as tools for evaluation of Data Mining processes. Knowl.-Based Syst. 2015, 80, 122–130. [Google Scholar] [CrossRef]
  23. Atanassov, K. Intuitionistic Fuzzy Logics; Springer: Cham, Switzerland, 2017. [Google Scholar]
  24. Liu, H.W.; Wang, G.J. Multi-criteria decision-making methods based on intuitionistic fuzzy sets. Eur. J. Operational Res. 2007, 179, 220–233. [Google Scholar] [CrossRef]
  25. Xu, Z.S. Intuitionistic Fuzzy Aggregatingon and Clustering; Springer: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
  26. Balasubramaniam, P.; Ananthi, V.P. Image fusion using intuitionistic fuzzy sets. Inf. Fusion 2014, 20, 21–30. [Google Scholar] [CrossRef]
  27. Zou, L.; Wen, X.; Wang, Y.X. Linguistic truth-valued intuitionistic fuzzy reasoning with applications in human factors engineering. Inf. Sci. 2016, 327, 201–216. [Google Scholar] [CrossRef]
  28. Duan, J.Y.; Li, X.Y. Similarity of intuitionistic fuzzy sets and its applications. Int. J. Approx. Reason. 2021, 137, 166–180. [Google Scholar] [CrossRef]
  29. Cornelis, C.; Deschrijver, G.; Kerre, E.E. Implication in intuitionistic fuzzy and interval-valued fuzzy set theory: Construction, classification, application. Int. J. Approx. Reason. 2004, 35, 55–95. [Google Scholar] [CrossRef] [Green Version]
  30. Zheng, M.C.; Shi, Z.K.; Liu, Y. Triple I method of approximate reasoning on Atanassov’s intuitionistic fuzzy sets. Int. J. Approx. Reason. 2014, 55, 1369–1382. [Google Scholar] [CrossRef]
  31. Liu, Y.; Zheng, M.C. The Dual Triple I Methods of FMT and IFMT. Math. Probl. Eng. 2014, 2014, 8. [Google Scholar] [CrossRef] [Green Version]
  32. Zheng, M.C.; Liu, Y. Multiple-rules reasoning based on Triple I method on Atanassovs intuitionistic fuzzy sets. Int. J. Approx. Reason. 2019, 113, 196–206. [Google Scholar] [CrossRef]
  33. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  34. Zheng, M.C.; Shi, Z.K.; Liu, Y. Triple I method of intuitionistic fuzzy reasoning based on residual implicator. Sci. China Inf. Sci. 2013, 43, 810–820. (In Chinese) [Google Scholar]
Figure 1. Flow diagram for solving the mixture type of GMP.
Figure 1. Flow diagram for solving the mixture type of GMP.
Symmetry 14 02184 g001
Table 1. Types of GMP in fuzzy/intuitionistic fuzzy environment.
Table 1. Types of GMP in fuzzy/intuitionistic fuzzy environment.
TypePQ P * Q *
1FFFF
2IFIFIFIF
3FFIF?
4IFIFF?
5FIFF?
6IFFIF?
7FIFIF?
8IFFF?
Table 2. Solutions of type 3 of GMP based on DTIM and ETIM.
Table 2. Solutions of type 3 of GMP based on DTIM and ETIM.
Type 3F/IFDTIMETIM
PFP ( P , 1 P )
QFQ ( Q , 1 Q )
P * IF ( P t * , P f * ) ( P t * , P f * )
Q 1 * ( v ) = u U { P t * ( u ) ( P ( u ) Q ( v ) ) } Q t * ( v ) = u U { P t * ( u ) ( P ( u ) Q ( v ) ) }
Q 2 * ( v ) = u U { P f * ( u ) ( P ( u ) Q ( v ) ) } Q f * ( v ) = u U { P f * ( u ) ( P ( u ) Q ( v ) ) }
Q f * ( v ) = u U { P f * ( u ) ( P ( u ) Q ( v ) ) }
Q * F Q * [ Q 1 * , Q 2 * ] Q * [ Q t * , Q f * ]
Q * IF Q * = ( Q 1 * , 1 Q 2 * ) Q * = ( Q t * , Q f * )
Table 3. Solutions of type 4 of GMP based on DTIM and ETIM.
Table 3. Solutions of type 4 of GMP based on DTIM and ETIM.
Type 4F/IFDTIMETIM
PIF ( P t , P f ) ( P t , P f )
QIF ( Q t , Q f ) ( Q t , Q f )
P * F P * ( P * , 1 P * )
Q 1 * ( v ) = u U { P * ( u ) ( P t ( u ) Q t ( v ) ) } Q t * ( v ) = u U { P * ( u ) ( ( P t ( u ) Q t ( v ) )
( P f ( u ) Q f ( v ) ) ) }
Q 2 * ( v ) = u U { P * ( u ) ( P f ( u ) Q f ( v ) ) } Q f * ( v ) = u U { ( 1 P * ( u ) ) ( 1
P f ( u ) Q f ( v ) ) }
Q f * ( v ) = u U { P * ( u ) ( P f ( u ) Q f ( v ) ) }
Q * F Q * = Q 1 * Q 2 * Q * [ Q t * , Q f * ]
Q * IF Q * = ( Q 1 * Q 2 * , 1 Q 2 * ) Q * = ( Q t * , Q f * )
Table 4. Solutions of type 5 of GMP based on DTIM and ETIM.
Table 4. Solutions of type 5 of GMP based on DTIM and ETIM.
Type 5F/IFDTIMETIM
PFP ( P , 1 P )
QIF ( Q t , Q f ) ( Q t , Q f )
P * F P * ( P * , 1 P * )
Q 1 * ( v ) = u U { P * ( u ) ( P ( u ) Q t ( v ) ) } Q t * ( v ) = u U { P * ( u ) ( P ( u ) Q t ( v ) ) }
Q 2 * ( v ) = u U { P * ( u ) ( P ( u ) Q f ( v ) ) } Q f * ( v ) = u U { ( 1 P * ( u ) ) ( 1 P ( u ) Q f ( v ) ) }
Q f * ( v ) = u U { P * ( u ) ( P ( u ) Q f ( v ) ) }
Q * F Q * [ Q 1 * , Q 2 * ] Q * [ Q t * , Q f * ]
Q * IF Q * = ( Q 1 * , 1 Q 2 * ) Q * = ( Q t * , Q f * )
Table 5. Solutions of type 6 of GMP based on DTIM and ETIM.
Table 5. Solutions of type 6 of GMP based on DTIM and ETIM.
Type 6F/IFDTIMETIM
PIF ( P t , P f ) ( P t , P f )
QFQ ( Q , 1 Q )
P * IF ( P t * , P f * ) ( P t * , P f * )
Q 1 * ( v ) = u U { P t * ( u ) ( P t ( u ) Q ( v ) ) } Q t * ( v ) = u U { P t * ( u ) ( P f ( u ) Q ( v ) ) }
Q 2 * ( v ) = u U { P f * ( u ) ( P f ( u ) Q ( v ) ) } Q f * ( v ) = u U { P f * ( u ) ( 1 P f ( u ) Q ( v ) ) }
Q f * ( v ) = u U { P f * ( u ) ( P f ( u ) Q ( v ) ) }
Q * F Q * = Q 1 * Q 2 * Q * [ Q t * , Q f * ]
Q * IF Q * = ( Q 1 * Q 2 * , 1 Q 2 * ) Q * = ( Q t * , Q f * )
Table 6. Solutions of type 7 of GMP based on DTIM and ETIM.
Table 6. Solutions of type 7 of GMP based on DTIM and ETIM.
Type 7F/IFDTIMETIM
PFP ( P , 1 P )
QIF ( Q t , Q f ) ( Q t , Q f )
P * IF ( P t * , P f * ) ( P t * , P f * )
Q 1 * ( v ) = u U { P t * ( u ) ( P ( u ) Q t ( v ) ) } Q t * ( v ) = u U { P t * ( u ) ( P ( u ) Q t ( v ) ) }
Q 2 * ( v ) = u U { P f * ( u ) ( P ( u ) Q f ( v ) ) } Q f * ( v ) = u U { P f * ( u ) ( 1 P ( u ) Q f ( v ) ) }
Q f * ( v ) = u U { P f * ( u ) ( P ( u ) Q f ( v ) ) }
Q * F Q * [ Q 1 * , Q 2 * ] Q * [ Q t * , Q f * ]
Q * IF Q * = ( Q 1 * , 1 Q 2 * ) Q * = ( Q t * , Q f * )
Table 7. Solutions of type 8 of GMP based on DTIM and ETIM.
Table 7. Solutions of type 8 of GMP based on DTIM and ETIM.
Type 8F/IFDTIMETIM
PIF ( P t , P f ) ( P t , P f )
QFQ ( Q , 1 Q )
P * F P * ( P * , 1 P * )
Q 1 * ( v ) = u U { P * ( u ) ( P t ( u ) Q ( v ) ) } Q t * ( v ) = u U { P * ( u ) ( P f ( u ) Q ( v ) ) }
Q 2 * ( v ) = u U { P * ( u ) ( P f ( u ) Q ( v ) ) } Q f * ( v ) = u U { ( 1 P * ( u ) ) ( 1 P f ( u ) Q ( v ) ) }
Q f * ( v ) = u U { P * ( u ) ( P f ( u ) Q ( v ) ) }
Q * F Q * [ Q 2 * , Q 1 * ] Q * = Q t * = Q f *
Q * IF Q * = ( Q 2 * , 1 Q 2 * ) Q * = ( Q t * , Q f * )
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zheng, M.; Liu, Y. Fuzzy Reasoning for Mixture of Fuzzy/Intuitionistic Fuzzy Information Based on Triple I Method. Symmetry 2022, 14, 2184. https://doi.org/10.3390/sym14102184

AMA Style

Zheng M, Liu Y. Fuzzy Reasoning for Mixture of Fuzzy/Intuitionistic Fuzzy Information Based on Triple I Method. Symmetry. 2022; 14(10):2184. https://doi.org/10.3390/sym14102184

Chicago/Turabian Style

Zheng, Mucong, and Yan Liu. 2022. "Fuzzy Reasoning for Mixture of Fuzzy/Intuitionistic Fuzzy Information Based on Triple I Method" Symmetry 14, no. 10: 2184. https://doi.org/10.3390/sym14102184

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop