Next Article in Journal
On a Surface Associated to the Catalan Triangle
Next Article in Special Issue
Application of the Methodology of Multi-Valued Logic Trees with Weighting Factors in the Optimization of a Proportional Valve
Previous Article in Journal
Some New Estimates for the Berezin Number of Hilbert Space Operators
Previous Article in Special Issue
Proving, Refuting, Improving—Looking for a Theorem
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Linear Diophantine Fuzzy Rough Sets on Paired Universes with Multi Stage Decision Analysis

1
Department of Mathematics, Quaid-i-Azam University, Islamabad 45320, Pakistan
2
Department of Mathematics, University of the Punjab, Lahore 54590, Pakistan
3
Department of Mathematics, Çankırı Karatekin University, Çankırı 18100, Turkey
4
Department of Structural Analysis, Technical University of Berlin, 10623 Berlin, Germany
5
Academy of Technical and Art Applied Studies Belgrade, University of Belgrade, 11000 Belgrade, Serbia
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(12), 686; https://doi.org/10.3390/axioms11120686
Submission received: 25 October 2022 / Revised: 23 November 2022 / Accepted: 26 November 2022 / Published: 30 November 2022
(This article belongs to the Special Issue 10th Anniversary of Axioms: Logic)

Abstract

:
Rough set (RS) and fuzzy set (FS) theories were developed to account for ambiguity in the data processing. The most persuasive and modernist abstraction of an FS is the linear Diophantine FS (LD-FS). This paper introduces a resilient hybrid linear Diophantine fuzzy RS model (LDF-RS) on paired universes based on a linear Diophantine fuzzy relation (LDF-R). This is a typical method of fuzzy RS (F-RS) and bipolar FRS (BF-RS) on two universes that are more appropriate and customizable. By using an LDF-level cut relation, the notions of lower approximation (L-A) and upper approximation (U-A) are defined. While this is going on, certain fundamental structural aspects of LD-FAs are thoroughly investigated, with some instances to back them up. This cutting-edge LDF-RS technique is crucial from both a theoretical and practical perspective in the field of medical assessment.

1. Introduction

As one of the most effective methods for developing a set’s embryonic concept, Zadeh [1] first proposed the idea of an FS in 1965. According to the attributes, FS permits grading a set’s features in the range of [ 0 , 1 ] . Since the conception of the theory, FS has been developed in a variety of ways, including intuitionistic fuzzy set (IF-S) [2,3], bipolar FS (B-FS) [4], Pythagorean FS (P-FS) [5,6], q-rung orthopair FS (q-ROF-S) [7], and LD-FS [8].
In 2019, Riaz and Hashmi [8] unveiled LD-FS, one of the most exquisite and significant generalizations of FS. Using the control parameters, LD-FS eliminates the restrictions connected to the membership degree (MD) and non-membership degree (NMD) of the prevalent abstractions of IF-Ss, B-FSs, and q-ROF-S. LD-FS is the most practical mathematical model for decision making (DM), multi-attribute decision making (MADM), engineering, artificial intelligence (AI), and medicine, allowing the decision maker to freely choose the grades [8]. Today, LD-FS is the owner of a huge study (see [9,10,11]). Ayub et al. [12] advanced an impressive method of an LDF-R to broaden the concept of IF-R, in which they provide an in-depth analysis of its essential characteristics, algebraic structures, and application in decision analysis.
While binary relations play a significant role in several domains for the transmission of unique things. In 1971, Zadeh [13] proposed the fuzzification of binary relations and presented the idea of an F-R. Numerous significant applications of FSs and F-Rs may be found in MCDM, neural networks, databases, pattern recognition, AI, clustering, F-control, and uncertainty reasoning. A thorough analysis of FSs and F-Rs is offered in [14].
The necessity to expand F-R was similar to that of FS. In 1984, Atanassov [15] proposed the concept of IF-R. An IF-R, per Atanassov’s definition [15], is a pair of F-Rs where the total of the coalition and alienation grades is less than or equal to 1. A soft set [16], being a parameterized collection of the universe objects, has robust applications in decision making. m-Polar neutrosophic topology provides a generalized topological structure for data analysis [17].
Pawlak [18,19] suggested an approach of RS to deal with uncertainty in intelligent systems as another abstraction of classical set theory. The L-A and U-A, which are used to define the M of objects in RS theory, are two sharp approximation (A) sets. The fundamental ideas of the RS theory, which reveals the hidden knowledge in information systems, are these approximations. AI, machine learning, conflict analysis, and data analysis are just a few fields where RS theory has been successfully applied.
Due to the equivalence relation (E-R) that underlies the RS theory, its application in practical situations is constrained. Numerous abstractions have been constructed to overcome the constraint of an E-R. For instance, RS based on a binary relation [20,21], a set-valued map [22], a tolerance relation [23], a similarity relation [24], a reflexive relation (R-R) and transitive relation (T-R) [25], a soft binary relation [26,27], a soft E-R [28], two E-Rs [29], a normal soft group [30], two soft binary relations, and two normal soft groups, demonstrates how an E-R may be adjusted with different granule interpretations. Zhan and Alcantud [31] proposed a new kind of soft rough covering by means of soft neighborhoods. Motivation of the proposed work is based on some existing methodologies such as attribute analysis [32], picture fuzzy aggregation [33], interval-valued picture fuzzy Maclaurin symmetric mean operator [34] complex interval-valued Pythagorean fuzzy aggregation [35], risk priority evaluation [36], roughness in soft-intersection groups [37], and roughness in modules of fractions [38]. Karamaşa et al. [39] proposed an extended SVN-AHP and MULTIMOORA method to for flight training organizations. Osintsev [40] suggested DEMATEL-ANP method for an evaluation of logistic flows in green supply chains.

1.1. Research Gap and Motivation

From all of the above-mentioned, the sequel summarizes the driving forces behind our research and the gaps that lie underneath it:
(1)
With the conceptualizations of the rough FS (R-FS) and fuzzy RS (F-RS) models (see [41,42,43,44]), Dubios and Prade [45] started the unification of RS and FS. Several authors have researched this idea (see [46,47,48]).
(2)
Incorporating two universes, Li and Wang [49] created the R-FSA imagination.
(3)
Yang [50] provided some of the applications for the notion of the roughness of a crisp set of two universes.
(4)
Yang et al. [51] presented the BF-RS’s idea on dual universe along with some of its applications.
(5)
Less research has been performed on the idea of roughness in dual universes, particularly in P-FS and q-ROF-S.
(6)
Ayub et al. [52] carefully thought out a method of applying RS to LD-FS with the aid of LDF-R and its applications in DM.
(7)
To the best of our knowledge, no research has been performed on the idea of LDF-S roughness using the level cut relation of an LDF-R.
(8)
To close this knowledge gap in the investigation of the roughness of LD-FSs, we introduce an abstraction of LDF-Rs using the level cut relations of an LDF-R on two different universal sets.

1.2. Major Contributions

This study uses level-cut relations from an LDF-R of dual universes to examine the roughness of an LD-FS. The fore set and after set of the level cut relations are used to design the underlying operations of RSs, the L- and U-As. With the use of useful examples, certain fundamental conclusions about As are demonstrated. We also defined the terms “accuracy measure” (A-M) and “roughness measure” (R-M) for LDF-RS. Finally, an LDF-RSs application to medical diagnosis is made to demonstrate its viability in real life.

1.3. Organization of the Paper

The remainder of this article is organized as follows to facilitate the study: In Section 2, some hypothetical early conceptions of RS, LD-FS, and LDF-R are provided. Using an LDF-R and a thorough examination of the essential characteristics of approximations with examples, the concept of LDF-RS on two distinct universes is introduced in the third segment. Section 4 includes the A-M and R-M cues for the LDF-RS. The application of LDF-RSs is demonstrated with the help of an example in Section 5. Section 6 concludes the paper by summarizing the final remarks.

2. Preliminaries

This subsection consists of some essential knowledge of LD-FS, LDF-R and RS. Throughout this research, U ˘ , U ˘ 1 and U ˘ 2 will denote the initial universes, unless otherwise specified.
Definition 1 
([19]). Let ρ be an E R on U ˘ . Then, the pair ( U ˘ , ρ ) is known as an R approximation space (R-AS). For any subset O of U ˘ , the L-A O ̲ ρ and the U-A O ¯ ρ are defined as follows:
O ̲ ρ = { v U ˘ : [ v ] ρ O } and O ¯ ρ = { v U ˘ : [ v ] ρ O }
where [ v ] ρ signifies an E-class of v U ˘ deduced by ρ. The boundary zone is indicated and described as follows:
B R ( O ) = O ¯ ρ O ̲ ρ
If B R ( O ) , then O is known as an RS or otherwise a crisp set or a definable set. Based on these As, Pawlak characterized a crisp set O U ˘ in the sequel:
O ̲ ρ consists of the definite members and is known as the positive region (PR) of O ;
U ˘ O ¯ ρ consists of the definite non-members and is known as the negative region (NR) of O ;
B R ( O ) contains questionable members that may or may not be contained in O and is known as the boundary region (BR).
Recently, Riaz and Hashmi [8] introduced an efficient approach to handling uncertainties that eradicate all the limitations related to affiliation and disassociation grades of the existing models (FS,B-FS,IF-S and P-FS).
Definition 2 
([8]). An LD-FS on U ˘ is an object defined as follows:
£ D = { ( v , < Θ M ( v ) , Θ N ( v ) > , < ϖ M ( v ) , ϖ M ( v ) > ) : v U ˘ }
where
Θ M , Θ N : U ˘ [ 0 , 1 ]
are M and NM functions and ϖ M ( v ) , ϖ N ( v ) [ 0 , 1 ] are the reference parameters of Θ M ( v ) , Θ N ( v ) respectively, such that 0 ϖ M ( v ) Θ M ( v ) + ϖ N ( v ) Θ N ( v ) 1 satisfying 0 ϖ M ( v ) + ϖ N ( v ) 1 for all u U ˘ . The hesitation part is defined as Λ ( v ) Π ( v ) = 1 ( ϖ M ( v ) Θ M ( v ) + ϖ N ( v ) Θ N ( v ) ) , where Π ( v ) expresses the degree of indeterminacy, and Λ ( v ) refers to the relevant reference parameter. We use the notion L D F S ( U ˘ ) to represent the collection of all LD-FSs on U ˘ .
By using control parameters that correspond to the association and disassociation grades in Riaz and Hashmi’s [8] motivation, Ayub et al. [12] have expanded the idea of IF-R [15] to LDF-R.
Definition 3 
([12]). An expression of the following form is an LDF-R ρ ¨ from U ˘ 1 to U ˘ 2 :
ρ ¨ = { ( ( v 1 , v 2 ) , < Θ M ( v 1 , v 2 ) , Θ N ( v 1 , v 2 ) > , < ϖ M ( v 1 , v 2 ) , ϖ N ( v 1 , v 2 ) > ) : v 1 U ˘ 1 , v 2 U ˘ 2 }
where the mappings
Θ M , Θ N : U ˘ 1 × U ˘ 2 [ 0 , 1 ]
indicate the M and NM F-Rs from U ˘ 1 to U ˘ 2 , respectively, and ϖ M ( v 1 , v 2 ) , ϖ N ( v 1 , v 2 ) [ 0 , 1 ] are the relevant reference parameters to Θ M ( v 1 , v 2 ) and Θ N ( v 1 , v 2 ) , respectively, fulfilling the requirement 0 ϖ M ( v 1 , v 2 ) Θ M ( v 1 , v 2 ) + ϖ N ( v 1 , v 2 ) Θ N ( v 1 , v 2 ) 1 , for all ( v 1 , v 2 ) U ˘ 1 × U ˘ 2 with 0 ϖ M ( v 1 , v 2 ) + ϖ N ( v 1 , v 2 ) 1 . The hesitation part is defined as follows:
γ ¨ ( v 1 , v 2 ) π ¨ ( v 1 , v 2 ) = 1 ( ϖ M ( v 1 , v 2 ) Θ M ( v 1 , v 2 ) + ϖ N ( v 1 , v 2 ) Θ N ( v 1 , v 2 ) )
where π ¨ ( v 1 , v 2 ) is the hesitation index, and γ ¨ ( v 1 , v 2 ) is the relevant reference parameter. For the sake of simplicity, we will use ρ ¨ = ( < Θ M ( v 1 , v 2 ) , Θ N ( v 1 , v 2 ) > , < ϖ M ( v 1 , v 2 ) , ϖ N ( v 1 , v 2 ) > ) for an LDF-R from U ˘ 1 to U ˘ 2 . The collection of all LDF-Rs from U ˘ 1 to U ˘ 2 will be designated by L D F R ( U ˘ 1 × U ˘ 2 ) .
With respect to finite universes U ˘ 1 and U ˘ 2 , the matrix notation of an LDF-R is given in the sequel.
Definition 4 
([12]). Let ρ ¨ = ( < Θ M ( u i , v j ) , Θ N ( u i , v j ) > , < ϖ M ( u i , v j ) , ϖ N ( u i , v j ) > ) be an LDF-R from U ˘ 1 to U ˘ 2 , where U ˘ 1 = { u 1 , u 2 , . . . , u m } and U ˘ 2 = { v 1 , v 2 , . . . , v n } . Consider Θ M ( u i , v j ) = ( Θ i j M ) m × n , Θ N ( u i , v j ) = ( Θ i j N ) m × n and ϖ M ( u i , v j ) = ( ϖ i j M ) m × n , ϖ N ( u i , v j ) = ( ϖ i j N ) m × n , with 0 ϖ i j M + ϖ i j M 1 fulfilling 0 ϖ i j M Θ i j M + ϖ i j M Θ i j N 1 for all i , j , where 1 i m and 1 j n . Then, the following four matrices can be used to represent ρ ¨ :
Θ M = ( Θ i j M ) m × n = Θ 11 M Θ 12 M . . . Θ 1 n M Θ 21 M Θ 22 M . . . Θ 2 n M . . . . . . . . . . . . . . . . . . Θ m 1 M Θ m 2 M . . . Θ m n M ,   Θ N = ( Θ i j N ) m × n = Θ 11 N Θ 12 N . . . Θ 1 n N Θ 21 N Θ 22 N . . . Θ 2 n N . . . . . . . . . . . . . . . . . . Θ m 1 N Θ m 2 N . . . Θ m n N , ϖ M = ( ϖ i j M ) m × n = ϖ 11 M ϖ 12 M . . . ϖ 1 n M ϖ 21 M ϖ 22 M . . . ϖ 2 n M . . . . . . . . . . . . . . . . . . ϖ m 1 M ϖ m 2 M . . . ϖ m n M ,   ϖ N = ( ϖ i j N ) m × n = ϖ 11 N ϖ 12 N . . . ϖ 1 n N ϖ 21 N ϖ 22 N . . . ϖ 2 n N . . . . . . . . . . . . . . . . . . ϖ m 1 N ϖ m 2 N . . . ϖ m n N
The following definitions describe some basic operations on LDF-Rs.
Definition 5 
([12]). Let ρ ¨ 1 = ( < Θ 1 M ( v 1 , v 2 ) , Θ 1 N ( v 1 , v 2 ) > , < ϖ 1 M ( v 1 , v 2 ) , ϖ 1 N ( v 1 , v 2 ) > ) and ρ ¨ 2 = ( < Θ 2 M ( v 1 , v 2 ) , Θ 2 N ( v 1 , v 2 ) > , < ϖ 2 M ( v 1 , v 2 ) , ϖ 2 N ( v 1 , v 2 ) > ) be two LDF-Rs from U ˘ 1 to U ˘ 2 . Then,
(1) 
ρ ¨ 1 ρ ¨ 2 if and only if
Θ 1 M ( v 1 , v 2 ) Θ 2 M ( v 1 , v 2 ) and Θ 1 N ( v 1 , v 2 ) Θ 2 N ( v 1 , v 2 ) ,
ϖ 1 M ( v 1 , v 2 ) ϖ 2 M ( v 1 , v 2 ) and ϖ 1 N ( v 1 , v 2 ) ϖ 2 N ( v 1 , v 2 )
(2) 
ρ ¨ 1 ρ ¨ 2 = ( < ( Θ 1 M Θ 2 M ) ( v 1 , v 2 ) , ( Θ 1 N Θ 2 N ) ( v 1 , v 2 ) > , < ϖ 1 M ( v 1 , v 2 ) ϖ 2 M ( v 1 , v 2 ) , ϖ 1 M ( v 1 , v 2 ) ϖ 2 N ( v 1 , v 2 ) > ) , where
( Θ 1 M Θ 2 M ) ( v 1 , v 2 ) = Θ 1 M ( v 1 , v 2 ) Θ 2 M ( v 1 , v 2 ) and
( Θ 1 N Θ 2 N ) ( v 1 , v 2 ) = Θ 1 N ( v 1 , v 2 ) Θ 2 N ( v 1 , v 2 )
(3) 
ρ ¨ 1 ρ ¨ 2 = ( < ( Θ 1 M Θ 2 M ) ( v 1 , v 2 ) , ( Θ 1 N Θ 2 N ) ( v 1 , v 2 ) > , < ϖ 1 M ( v 1 , v 2 ) ϖ 2 M ( v 1 , v 2 ) , ϖ 1 N ( v 1 , v 2 ) ϖ 2 N ( v 1 , v 2 ) > ) , where
( Θ 1 M Θ 2 M ) ( v 1 , v 2 ) = Θ 1 M ( v 1 , v 2 ) Θ 2 M ( v 1 , v 2 ) and
( Θ 1 N Θ 2 N ) ( v 1 , v 2 ) = Θ 1 N ( v 1 , v 2 ) Θ 2 N ( v 1 , v 2 )
(4) 
ρ ¨ 1 c = ( < Θ 1 N ( v 1 , v 2 ) , Θ 1 M ( v 1 , v 2 ) > , < ϖ 1 N ( v 1 , v 2 ) , ϖ 1 M ( v 1 , v 2 ) > ) .
for all ( v 1 , v 2 ) U ˘ 1 × U ˘ 2 .
Definition 6 
([12]). Let ρ ¨ 1 = ( < Θ 1 M ( v 1 , v 2 ) , Θ 1 N ( v 1 , v 2 ) > , < ϖ 1 M ( v 1 , v 2 ) , ϖ 1 N ( v 1 , v 2 ) > ) be an LDF-R over U ˘ 1 × U ˘ 2 and ρ ¨ 2 = ( < Θ 2 M ( v 1 , v 2 ) , Θ 2 N ( v 1 , v 2 ) > , < ϖ 2 M ( v 1 , v 2 ) , ϖ 2 N ( v 1 , v 2 ) > ) be an LDF-R over U ˘ 2 × U ˘ 3 . Then, their composition is denoted by ^ and is determined accordingly:
ρ ¨ 1 ^ ρ ¨ 2 = ( < ( Θ 1 M ^ Θ 2 M ) ( v 1 , v 3 ) , ( Θ 1 N ^ Θ 2 N ) ( v 1 , v 3 ) > , < ( ϖ 1 M ^ ϖ 2 M ) ( v 1 , v 3 ) , ( ϖ 1 N ^ ϖ 2 N ) ( v 1 , v 3 ) > )
where
( Θ 1 M ^ Θ 2 M ) ( v 1 , v 3 ) = x 2 U ˘ 2 ( Θ 1 M ( v 1 , v 2 ) Θ 2 M ( v 2 , v 3 ) )
( Θ 1 N ^ Θ 2 N ) ( v 1 , v 3 ) = x 2 U ˘ 2 ( Θ 1 N ( v 1 , v 2 ) Θ 2 N ( v 2 , v 3 ) )
and
( ϖ 1 M ^ ϖ 2 M ) ( v 1 , v 3 ) = u 2 U ˘ 2 ( ϖ 1 M ( v 1 , v 2 ) ϖ 2 M ( v 2 , v 3 ) )
( ϖ 1 N ^ ϖ 2 N ) ( v 1 , v 3 ) = u 2 U ˘ 2 ( ϖ 1 N ( v 1 , v 2 ) ϖ 2 N ( v 2 , v 3 ) )
for all ( v 1 , v 3 ) U ˘ 1 × U ˘ 3 .
Definition 7 
([12]). Let ρ ¨ be an LDF-R on U ˘ . Then, ρ ¨ is classified as:
(1) 
a reflexive LDF-R (R-LDF-R), if:
Θ M ( v , v ) = 1 , Θ N ( v , v ) = 0 and ϖ M ( v , v ) = 1 , ϖ N ( v , v ) = 0
for all u U ˘ .
(2) 
a symmetric LDF-R (S-LDF-R), if
Θ M ( v 1 , v 2 ) = Θ M ( v 2 , v 1 ) , Θ N ( v 1 , v 2 ) = Θ N ( v 2 , v 1 ) and α ¨ ( v 1 , v 2 ) = α ¨ ( v 2 , v 1 ) , β ¨ ( v 1 , v 2 ) = β ¨ ( v 2 , v 1 )
(3) 
a transitive LDF-R (T-LDF-R), if
Θ M ^ Θ M Θ M , Θ N ^ Θ N Θ N and ϖ M ^ ϖ M ϖ M , ϖ N ^ ϖ N ϖ N
(4) 
an equivalence LDF-R (E-LDF-R), if ρ ¨ is a R-, S-, and T-LDF-R over U ˘ .
If | U ˘ | = n , where | . | indicates the quantity of items in U ˘ , ρ ¨ = ( < ( Θ i j M ) n × n , ( Θ i j N ) n × n > , < ( ϖ i j M ) n × n , ( ϖ i j N ) n × n > ) . Let Θ M = ( Θ i j M ) n × n , Θ N = ( Θ i j N ) n × n and ϖ M = ( ϖ i j M ) n × n , ϖ N = ( ϖ i j N ) n × n . Then,
(1)
ρ ¨ is R, if Θ i i M = ϖ i i M = 1 , and Θ i i N = ϖ i i N = 0 , where i , j = 1 , 2 , . . . , n .
(2)
ρ ¨ is S, if ( Θ M ) T = Θ M , ( Θ N ) T = Θ N and ( ϖ M ) T = ϖ M , ( s s ϖ N ) T = ϖ N ,
(3)
ρ ¨ is T, if Θ M ^ Θ M Θ M , Θ N ^ Θ N Θ N and ϖ M ^ ϖ M ϖ M , ϖ N ^ ϖ N ϖ N .
(4)
ρ ¨ is E, if ρ ¨ is R, S and T as well,

3. Some Properties of Linear Diophantine Fuzzy Relation

Ayub et al. [12] proposed the idea of LDF-R from U ˘ 1 to U ˘ 2 . The purpose of this section is to introduce the idea of a level cut relation of an LDF-R. Additionally, we investigate a few of its crucial characteristics, including the R-, S-, and T-LDF-R in terms of its level cut relations.
Definition 8. 
Let ρ ¨ = ( < Θ M ( v 1 , v 2 ) , Θ N ( v 1 , v 2 ) > , < ϖ M ( v 1 , v 2 ) , ϖ N ( v 1 , v 2 ) > ) be an LDF-R from U ˘ 1 to U ˘ 2 . Let s ¨ , t ¨ , u ¨ , v ¨ [ 0 , 1 ] be such that 0 s ¨ u ¨ + t ¨ v ¨ 1 with 0 u ¨ + v ¨ 1 , and define the ( < s ¨ , u ¨ > , < t ¨ , v ¨ > ) level cut relation of ρ ¨ as follows:
( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > = { ( v 1 , v 2 ) U ˘ 1 × U ˘ 2 : Θ M ( v 1 , v 2 ) s ¨ , ϖ M ( v 1 , v 2 ) u ¨ and Θ N ( v 1 , v 2 ) t ¨ , ϖ N ( v 1 , v 2 ) v ¨ }
where
( ρ ¨ ) < s ¨ , u ¨ > = { ( v 1 , v 2 ) U ˘ 1 × U ˘ 2 : Θ M ( v 1 , v 2 ) s ¨ , ϖ M ( v 1 , v 2 ) u ¨ }
is said to be < s ¨ , u ¨ > level cut relation of ρ ¨ , and
( ρ ¨ ) < t ¨ , v ¨ > = { ( v 1 , v 2 ) U ˘ 1 × U ˘ 2 : Θ N ( v 1 , v 2 ) t ¨ , ϖ N ( v 1 , v 2 ) v ¨ }
is called < t ¨ , v ¨ > level cut relation of ρ ¨ .
Theorem 1. 
ρ ¨ is R-LDF-R if and only if ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is R-R on U ˘ , for all s ¨ , u ¨ , t ¨ , v ¨ [ 0 , 1 ] .
Proof. 
Suppose that ρ ¨ is R-LDF-R. By Definition 7 ( 1 ) , Θ M ( v , v ) = 1 s ¨ , Θ N ( v , v ) = 0 t ¨ and ϖ M ( v , v ) = 1 u ¨ , ϖ N ( v , v ) = 0 v ¨ , for all s ¨ , t ¨ , u ¨ , v ¨ [ 0 , 1 ] such that 0 s ¨ u ¨ + t ¨ v ¨ 1 with 0 u ¨ + v ¨ 1 . Hence, ( x , x ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > for all u U ˘ .
Conversely, assume that ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is R-R. If ρ ¨ is not R-LDF-R, then for some v U ˘ either Θ M ( v , v ) 1 , or Θ N ( v , v ) 0 or ϖ M ( v , v ) 1 or ϖ N ( v , v ) 0 , for some s ¨ , t ¨ , u ¨ , v ¨ [ 0 , 1 ] . If Θ M ( v , v ) 1 . Taking s ¨ = 1 , we have ( x , x ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > , which is a contradiction. The other three cases are similar. Hence, ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is a R-R. □
Theorem 2. 
ρ ¨ is S-LDF-R if and only if ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is S-R on U ˘ , for all s ¨ , u ¨ , t ¨ , v ¨ [ 0 , 1 ] .
Proof. 
Suppose that ρ ¨ is S-LDF-R. Let ( v 1 , v 2 ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > . By Definition 8, Θ M ( v 1 , v 2 ) s ¨ , ϖ M ( v 1 , v 2 ) u ¨ and Θ N ( v 1 , v 2 ) t ¨ , ϖ N ( v 1 , v 2 ) v ¨ . Since ρ ¨ is symmetric, so we have Θ M ( v 2 , v 1 ) s ¨ , ϖ M ( v 2 , v 1 ) u ¨ and Θ N ( v 2 , v 1 ) t ¨ , ϖ N ( v 2 , v 1 ) v ¨ (see Definition 7 (2)). Thus, ( v 2 , v 1 ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > .
Conversely, assume that ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is S-R on U ˘ . Letting Θ M ( v 1 , v 2 ) = s ¨ , ϖ M ( v 1 , v 2 ) = u ¨ and Θ N ( v 1 , v 2 ) = t ¨ , ϖ N ( v 1 , v 2 ) = v ¨ , for some s ¨ , t ¨ , u ¨ , v ¨ [ 0 , 1 ] such that 0 s ¨ u ¨ + t ¨ v ¨ 1 with 0 u ¨ + v ¨ 1 . It follows that ( v 1 , v 2 ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > . By assumption on ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > , we have ( v 2 , v 1 ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > . Thus, Θ M ( v 2 , v 1 ) s ¨ = Θ M ( v 2 , v 1 ) , ϖ M ( v 2 , v 1 ) u ¨ = ϖ M ( v 1 , v 2 ) and Θ N ( v 2 , v 1 ) t ¨ = Θ N ( v 1 , v 2 ) , β ( v 2 , v 1 ) v ¨ = ϖ N ( v 1 , v 2 ) . By using similar arguments, other inequalities can be shown. Thus, ρ ¨ is S-LDF-R on U ˘ . This completes the proof. □
Proposition 1. 
ρ ¨ is T-LDF-R if and only if
Θ M ( v 1 , v 2 ) Θ M ( v 2 , v 3 ) Θ M ( v 1 , v 3 ) , Θ N ( v 1 , v 2 ) Θ N ( v 2 , v 3 ) Θ N ( v 1 , v 3 )
and ϖ M ( v 1 , v 2 ) ϖ M ( v 2 , v 3 ) ϖ M ( v 1 , v 3 ) , ϖ N ( v 1 , v 2 ) ϖ N ( v 2 , v 3 ) ϖ N ( v 1 , v 3 ) ,
for all v 1 , v 2 , v 3 U ˘ .
Proof. 
Suppose that ρ ¨ is T-LDF-R on U ˘ . By Definition 7 ( 3 ) , ( Θ M ^ Θ M ) ( v 1 , v 3 ) Θ M ( v 1 , v 3 ) , ( Θ N ^ Θ N ) ( v 1 , v 3 ) Θ N ( v 1 , v 3 ) and ( ϖ M ^ ϖ M ) ( v 1 , v 3 ) ϖ M ( v 1 , v 3 ) , ( ϖ N ^ ϖ N ) ( v 1 , v 3 ) ϖ N ( v 1 , v 3 ) , for all v 1 , v 3 U ˘ . Thus, Θ M ( v 1 , v 2 ) Θ M ( v 2 , v 3 ) Θ M ( v 1 , v 3 ) , Θ N ( v 1 , v 2 ) Θ N ( v 2 , v 3 ) Θ N ( v 1 , v 3 ) and ϖ M ( v 1 , v 2 ) ϖ M ( v 2 , v 3 ) ϖ M ( v 1 , v 3 ) , ϖ N ( v 1 , v 2 ) ϖ N ( v 2 , v 3 ) ϖ N ( v 1 , v 3 ) , for all v 1 , v 2 , v 3 U ˘ (see Definition 6). The converse can be proven, similarly. □
Theorem 3. 
ρ ¨ is a T-LDF-R if and only if ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is T-R on U ˘ , for all s ¨ , u ¨ , t ¨ , v ¨ [ 0 , 1 ] .
Proof. 
Suppose that ρ ¨ is T-LDF-R. Let ( v 1 , v 2 ) , ( v 2 , v 3 ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > . Then, Θ M ( v 1 , v 2 ) Θ M ( v 2 , v 3 ) s ¨ , α ( v 1 , v 2 ) α ( v 2 , v 3 ) u ¨ and Θ N ( v 1 , v 2 ) Θ N ( v 2 , v 3 ) t ¨ , β ( v 1 , v 2 ) β ( v 2 , v 3 ) v ¨ (see Definition 8). Using above Proposition 1, we obtain: Θ M ( v 1 , v 3 ) s ¨ , ϖ M ( v 1 , v 3 ) u ¨ , Θ N ( v 1 , v 3 ) t ¨ , ϖ N ( v 1 , v 3 ) v ¨ . Thus, ( v 1 , v 3 ) ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > . □
Theorem 4. 
ρ ¨ is an E-LDF-R if and only if ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is an E-R on U ˘ , for all s ¨ , t ¨ , u ¨ , v ¨ [ 0 , 1 ] .
Proof. 
Theorems 1–3 have a direct impact on the proof. □
Now, to measure the ‘resemblance’, ‘comparability’ or ‘closeness’ of the objects in U ˘ , we define the following concept.
Definition 9. 
ρ ¨ is said to be a tolerance LDF-R (or compatible LDF-R), if it is R-LDF-R and S-LDF-R.
To illustrate our above notions, we provide Example 2 below.
Example 1. 
Let U ˘ = { v 1 , v 2 , v 3 , v 4 } . Construct an LDF-R ρ ¨ on U ˘ in matrix notation form as follows:
Θ M = 1 0.725 0.862 0.921 0.725 1 0.815 0.132 0.862 0.815 1 0.325 0.921 0.132 0.325 1 , Θ N = 0 0.218 0.125 0.215 0.218 0 0.651 0.334 0.125 0.651 0 0.728 0.215 0.334 0.728 0 ,
ϖ M = 1 0.71 0.81 0.89 0.71 1 0.75 0.11 0.81 0.75 1 0.21 0.89 0.11 0.21 1 , ϖ N = 0 0.16 0.10 0.11 0.16 0 0.25 0.34 0.10 0.25 0 0.64 0.11 0.34 0.64 0 .
Using Definition 8 of ( < s ¨ , u ¨ > , < t ¨ , v ¨ > ) -level cut relation, we are able to obtain the following:
For s ¨ = u ¨ = 1 , t ¨ = v ¨ = 0 ,
( ρ ¨ ) < 1 , 1 > < 0 , 0 > = { ( v 1 , v 1 ) , ( v 2 , v 2 ) , ( v 3 , v 3 ) , ( v 4 , v 4 ) }
For s ¨ = 0.725 , u ¨ = 0.71 and t ¨ = 0.218 , v ¨ = 0.16 ,
( ρ ¨ ) < 0.725 , 0.71 > < 0.218 , 0.16 > = { ( v 1 , v 1 ) , ( v 1 , v 2 ) , ( v 1 , v 3 ) , ( v 2 , v 1 ) , ( v 2 , v 2 ) , ( v 3 , v 1 ) , ( v 3 , v 3 ) , ( v 4 , v 1 ) , ( v 4 , v 4 ) }
For s ¨ = 0.862 , u ¨ = 0.81 and t ¨ = 0.125 , v ¨ = 0.10 ,
( ρ ¨ ) < 0.862 , 0.81 > < 0.125 , 0.10 > = { ( v 1 , v 1 ) , ( v 1 , v 3 ) ( v 2 , v 2 ) , ( v 3 , v 1 ) , ( v 3 , v 3 ) , ( v 4 , v 4 ) }
For s ¨ = 0.921 , u ¨ = 0.89 and t ¨ = 0.215 , v ¨ = 0.11 ,
( ρ ¨ ) < 0.921 , 0.89 > < 0.215 , 0.11 > = { ( v 1 , v 1 ) , ( v 1 , v 4 ) , ( v 2 , v 2 ) , ( v 3 , v 3 ) , ( v 4 , v 1 ) , ( v 4 , v 4 ) }
For s ¨ = 0.815 , u ¨ = 0.75 and t ¨ = 0.651 , v ¨ = 0.25 ,
( ρ ¨ ) < 0.815 , 0.75 > < 0.651 , 0.25 > = { ( v 1 , v 1 ) , ( v 1 , v 3 ) , ( v 1 , v 4 ) , ( v 2 , v 2 ) , ( v 2 , v 3 ) , ( v 3 , v 1 ) , ( v 3 , v 2 ) , ( v 3 , v 3 ) , ( v 4 , v 1 ) , ( v 4 , v 4 ) }
For s ¨ = 0.132 , u ¨ = 0.11 and t ¨ = 0.334 , v ¨ = 0.34 ,
( ρ ¨ ) < 0.132 , 0.11 > < 0.334 , 0.34 > = { ( v 1 , v 1 ) , ( v 1 , v 2 ) , ( v 1 , v 3 ) , ( v 1 , v 4 ) , ( v 2 , v 1 ) , ( v 2 , v 2 ) , ( v 2 , v 4 ) , ( v 3 , v 1 ) , ( v 3 , v 3 ) , ( v 4 , v 1 ) , ( v 4 , v 2 ) , ( v 4 , v 4 ) }
For s ¨ = 0.325 , u ¨ = 0.21 and t ¨ = 0.728 , v ¨ = 0.64 ,
( ρ ¨ ) < 0.325 , 0.21 > < 0.728 , 0.64 > = ( U ˘ × U ˘ ) \ { ( v 2 , v 4 ) , ( v 4 , v 2 ) }
It is simple to observe that ( ρ ¨ ) < s ¨ , u ¨ > < t ¨ , v ¨ > is an E-R on U ˘ , for each s ¨ , u ¨ , t ¨ , v ¨ . Hence, by using Theorem 4, ρ ¨ is an E-LDF-R on U ˘ .

4. Linear Diophantine Fuzzy Rough Sets on Two Universes

In literature, R-As on two different universes using F-R are initiated by Sun and Ma [48]. Since the NM part is not discussed in F-R, Yang et al. [51] extended the concept of [48] to fuzzy bipolar relation (FB-R). In this segment, we generalize this concept to LDF-R and introduce a new concept of roughness called LDF-RS on two universes based on the after sets and fore sets of the level cut relation of an LDF-R (a crisp relation).
If ρ ¨ L D F R ( U ˘ 1 × U ˘ 2 ) , then the triplet P ¨ = ( U ˘ 1 , U ˘ 2 , ρ ¨ ) is called an LDF rough approximation space (LDF-RAS).
Definition 10. 
Let P ¨ = ( U ˘ 1 , U ˘ 2 , ρ ¨ ) be an LDF-RAS and Y U ˘ 2 . Describe the L-A a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ of Y and the U-A a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ of Y as follows:
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ = { v 1 U ˘ 1 : v 1 ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > Y } ;
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ = { v 1 U ˘ 1 : v 1 ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > , v 1 ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > Y }
Similarly, we can define the L-A ( X ) a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ̲ and U-A ( X ) a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ¯ for any subset X U ˘ 1 as follows:
( X ) a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ̲ = { v 2 U ˘ 2 : ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > v 2 X }
( X ) a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ¯ = { v 2 U ˘ 2 : ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > v 2 , ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > v 2 X }
where v 2 ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > = { v 2 U ˘ 2 : ( v 1 , v 2 ) ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > } and ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > v 2 = { v 1 U ˘ 1 : ( v 1 , v 2 ) ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > } .
Remark 1. 
(1) 
If U ˘ 1 = U ˘ 2 , then the L-A and U-A for any X U ˘ 1 can also be defined as in the above Definition 10.
(2) 
All the notions and results for any subset Y of U ˘ 2 from Definition 11 to Theorem 5 can be proved in similar manners for any subset X U ˘ 1 .
Definition 11. 
Let P ¨ = ( U ˘ 1 , U ˘ 2 , ρ ¨ ) be an LDF-RAS and Y U ˘ 2 . Then, the following sets are defined as follows:
(1) 
L D F P O S P ¨ ( Y ) = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ ;
(2) 
L D F B N D P ¨ ( Y ) = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ ;
(3) 
L D F N E G P ¨ ( Y ) = U ˘ 2 a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ = ( a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ) c ¯ .
are called the PR, BR and NR of Y U ˘ 2 , respectively.
In the sequel of this manuscript, we mean P ¨ = ( U ˘ 1 , U ˘ 2 , ρ ¨ ) as a LDF-RAS and s ¨ , u ¨ ( 0 , 1 ] , t ¨ , v ¨ [ 0 , 1 ) .
Proposition 2. 
Let Y 1 , Y 2 U ˘ 2 . Then,
(1) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ̲ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ ;
(2) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( ) ¯ = = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( ) ̲ ;
(3) 
If Y 1 Y 2 , then a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ̲ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ̲ ;
(4) 
Y 1 Y 2 , then a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ ;
(5) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 Y 2 ) ̲ = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ̲ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ̲ ;
(6) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 Y 2 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ ;
(7) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 Y 2 ) ̲ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ̲ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ̲ ;
(8) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 Y 2 ) ¯ = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯
Proof. 
All the assertions can be easily proved by using Definition 10. □
Note that: if x ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > , then the assertions ( 1 ) and ( 2 ) may not hold (see Example 1).
Example 2. 
Let U ˘ 1 = { u 1 , u 2 , u 3 } and U ˘ 2 = { v 1 , v 2 , v 3 } be the universal sets. Then, we define an LDF-R ρ ¨ from U ˘ 1 to U ˘ 2 in the matrix notations given as below:
Θ M = 0.77 0.57 0.67 0.55 0.48 0.50 0.68 0.45 0.43 , Θ N = 0.71 0.41 0.56 0.80 0.72 0.46 0.54 0.40 0.22 ,
ϖ M = 0.51 0.50 0.61 0.46 0.40 0.37 0.54 0.39 0.35 , ϖ N = 0.49 0.46 0.38 0.52 0.58 0.58 0.45 0.56 0.61 .
Using Definition 8 of ( < s ¨ , u ¨ > , < t ¨ , v ¨ > ) -level cut relation, for s ¨ = 0.77 , u ¨ = 0.51 , t ¨ = 0.71 , v ¨ = 0.49 , we can obtain:
u 1 ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > = { v 1 } , u 2 ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > = u 3 ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > =
Suppose Y = { v 1 , v 2 } . Then by Definition 10,
( Y ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ̲ = U 1 , ( Y ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ¯ = { u 1 }
( ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ̲ = { u 2 , u 3 } , ( ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ¯ =
( U 2 ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ̲ = U 1 , ( U 2 ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ¯ = { u 1 }
Thus, we obtain that ( ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ̲ and ( U 2 ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ¯ U 1 . However, if u ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > , then:
( U 2 ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ̲ = ( U 2 ) a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ¯ = { u 1 } U 1
(see Proposition 3).
Proposition 3. 
Let ρ ¨ be a R-LDF-R on U ˘ 1 and s ¨ , u ¨ ( 0 , 1 ] , t ¨ , v ¨ [ 0 , 1 ) . For any subset Y U ¨ 1 , the following properties hold:
(1) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ Y a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ ;
(2) 
a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( U ˘ 1 ) ̲ = U ˘ 1 = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( U ˘ 1 ) ¯ .
Proof. 
The proof is straightforward. □
Lemma 1. 
Suppose that s ¨ 1 , s ¨ 2 , u ¨ 1 , u ¨ 2 ( 0 , 1 ] and t ¨ 1 , t ¨ 2 , v ¨ 1 , v ¨ 2 [ 0 , 1 ) such that s ¨ 1 s ¨ 2 , u ¨ 1 u ¨ 2 and t ¨ 2 t ¨ 1 , v ¨ 2 v ¨ 1 . Then,
ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > .
Proof. 
Let ( v 1 , v 2 ) ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > . Using Definition 8, Θ M ( v 1 , v 2 ) s ¨ 2 , ϖ M ( v 1 , v 2 ) u ¨ 2 and Θ N ( v 1 , v 2 ) t ¨ 2 , ϖ N ( v 1 , v 2 ) v ¨ 2 . Since s ¨ 1 s ¨ 2 , u ¨ 1 u ¨ 2 and t ¨ 2 t ¨ 1 , v ¨ 2 v ¨ 1 , so
Θ M ( v 1 , v 2 ) s ¨ 2 s ¨ 1 , ϖ M ( v 1 , v 2 ) u ¨ 2 u ¨ 1 and Θ N ( v 1 , v 2 ) t ¨ 2 t ¨ 1 , ϖ N ( v 1 , v 2 ) v ¨ 2 v ¨ 1
Hence, Θ M ( v 1 , v 2 ) s ¨ 1 , ϖ M ( v 1 , v 2 ) u ¨ 1 and Θ N ( v 1 , v 2 ) t ¨ 1 , ϖ N ( v 1 , v 2 ) v ¨ 1 . Thus ( v 1 , v 2 ) ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > . □
Proposition 4. 
With the same assumptions as in the above Lemma 1, suppose that Y U ˘ 2 . Then, the following assertions are true:
(1) 
a p p r ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > ( Y ) ¯ a p p r ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > ( Y ) ¯ ,
(2) 
a p p r ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > ( Y ) ̲ a p p r ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > ( Y ) ̲ .
Proof. (1) 
Let v 1 a p p r ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > ( Y ) ¯ . From Definition 10, v 2 v 1 ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > Y for some v 2 U 1 . Since v 1 ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > v 1 ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > , therefore v 2 v 1 ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > Y (using Lemma 1). Hence, v 1 a p p r ρ ¨ < s ¨ ¨ 1 , u ¨ 1 > < t 1 , v 1 > ( Y ) ¯ .
( 2 ) Let v 1 a p p r ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > ( Y ) ̲ . By Definition 10, v 1 ρ ¨ < s ¨ 1 , u ¨ 1 > < t ¨ 1 , v ¨ 1 > Y . From Lemma 1, v 1 ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > Y . This proves that v 1 a p p r ρ ¨ < s ¨ 2 , u ¨ 2 > < t ¨ 2 , v ¨ 2 > ( Y ) ̲ . □
The inclusions in Proposition 4 may not hold, as is demonstrated in the sequel.
Example 3. 
Let us revisit Example 2, assume s ¨ 1 = 0.55 , u ¨ 1 = 0.46 , t ¨ 1 = 0.80 , v ¨ 1 = 0.52 and s ¨ 2 = 0.77 , u ¨ 2 = 0.51 , t ¨ 2 = 0.71 , v ¨ 2 = 0.49 . Then by Definition 8,
u 1 ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > = U 2 , u 2 ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > = u 3 ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > = { v 1 }
u 1 ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > = { v 1 } , u 2 ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > = u 3 ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > =
Take Y = { v 1 } , then by Definition 10, we have:
a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ( Y ) ̲ = a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ( Y ) ¯ = { u 1 }
a p p r ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > ( Y ) ̲ = { u 2 , u 3 } , a p p r ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > ( Y ) ¯ = U 1
Since s ¨ 1 < s ¨ 2 , u ¨ 1 < u ¨ 2 and t ¨ 1 > t ¨ 2 , v ¨ 1 > v ¨ 2 , but a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ( Y ) ¯ and a p p r ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > ( Y ) ̲ a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ( Y ) ̲ .
Lemma 2. 
Let ρ ¨ 1 , ρ ¨ 2 L D F R ( U ˘ 1 × U ˘ 2 ) be such that ρ ¨ 1 ρ ¨ 2 . Then,
ρ 1 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ρ 2 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ >
Proof. 
Let ( v 1 , v 2 ) ρ 1 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > . By Definition 8, Θ 1 M ( v 1 , v 2 ) s ¨ , ϖ 1 M ( v 1 , v 2 ) u ¨ and Θ 1 N ( v 1 , v 2 ) t ¨ , ϖ 1 N ( v 1 , v 2 ) v ¨ . Since ρ ¨ 1 ρ ¨ 2 , therefore s ¨ Θ 1 M ( v 1 , v 2 ) Θ 2 M ( v 1 , v 2 ) , u ¨ ϖ 1 M ( v 1 , v 2 ) ϖ 2 M ( v 1 , v 2 ) and t ¨ Θ 1 N ( v 1 , v 2 ) Θ 2 N ( v 1 , v 2 ) , v ¨ ϖ 1 N ( v 1 , v 2 ) ϖ 2 N ( v 1 , v 2 ) . Hence, Θ 2 M ( v 1 , v 2 ) s ¨ , ϖ 2 M ( v 1 , v 2 ) u ¨ and Θ 2 N ( v 1 , v 2 ) t ¨ , ϖ 2 N ( v 1 , v 2 ) v ¨ . Thus, ( v 1 , v 2 ) ρ 2 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > . □
Proposition 5. 
With the same notations as in Lemma 2, assume that Y U ˘ 2 . Then,
(1) 
a p p r ρ 2 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ a p p r ρ 1 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ ,
(2) 
a p p r ρ 1 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ a p p r ρ 2 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ .
Proof. (1) 
Let v a p p r ρ 2 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ . Then, v ρ 2 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > Y . By Lemma 2, v ρ 1 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > v ρ 2 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > Y . Hence, x ρ 1 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > Y . This proves that v a p p r ρ 1 ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ . Similar to the proof of ( 1 ) , proof of ( 2 ) . □

5. Accuracy Measure and Roughness Measure for LDF-RSs on Two Universes

The concept of A-M and R-M was first invented by Pawlak in 1982 in order to define the imprecision of R-As. Our perception of the accuracy of the data relating to an E-R for a given classification is based on these numerical measures. In [51], Yang et al. gave the idea of A-M and R-M for BF-RSs on dual universes. In this passage, we extend this concept to LDF-RSs on two universes.
With respect to a Pawlak A-S P = ( U ˘ , ρ ) , where ρ is an E-R on U ˘ . Then the A-M and R-M of O of U ˘ are defined as follows, respectively:
A M ( O ) = ρ ( O ) ̲ ρ ( O ) ¯ and R M ( O ) = 1 A M ( O ) .
We define the subsequent ideas by using the same pattern.
Definition 12. 
Let P ¨ = ( U ˘ 1 , U ˘ 2 , ρ ¨ ) be an LDF-RAS and Y U ˘ 2 , define the AM of Y with respect to ρ ¨ as follows:
A M ( Y ) = | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ | | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ |
where | . | indicates the number of elements in the sets. After that, we define the RM of Y U ˘ 2 with respect to ρ ¨ as follows:
R M ( Y ) = 1 A M ( Y )
Remark 2. 
The following points can be deduced from Definition 12 given above:
(1) 
A M ( Y ) , R M ( Y ) [ 0 , 1 ] .
(2) 
If s ¨ = u ¨ = 1 and t ¨ = v ¨ = 0 , then A M ( Y ) = 1 and R M ( Y ) = 0 .
In the following, we construct an example for the clarification of the above Definition 12.
Example 4. 
In Example 3, for s ¨ 1 = 0.55 , u ¨ 1 = 0.46 , t ¨ 1 = 0.80 , v ¨ 1 = 0.52 and Y = { y 1 } , we have:
a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ( Y ) ̲ = a p p r ρ ¨ < 0.77 , 0.51 > < 0.71 , 0.49 > ( Y ) ¯ = { x 1 }
Thus, by Definition 12, M A ( Y ) = 1 and M R ( Y ) = 0 . Hence, our information related to ρ ¨ is accurate up to grade 1, which means that ρ ¨ describes the objects of Y absolutely accurately. On the other hand, for s ¨ 2 = 0.77 , u ¨ 2 = 0.51 , t ¨ 2 = 0.71 , v ¨ 2 = 0.49 and Y = { y 1 } , we have:
a p p r ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > ( Y ) ̲ = { x 2 , x 3 } , a p p r ρ ¨ < 0.55 , 0.46 > < 0.80 , 0.52 > ( Y ) ¯ = U ˘ 1
Then, M A ( Y ) = 2 3 and M R ( Y ) = 1 3 . Hence, our information related to ρ ¨ is accurate up to grade 0.6666, which means that ρ ¨ describes the items of U 2 ˘ accurately up to grade 0.6666.
In the following result, we describe a connection of the A-M A M ( Y ) and R-M R M ( Y ) about the union and intersection of Y 1 and Y 2 on the universe U 2 .
Theorem 5. 
Let P ¨ = ( U ˘ 1 , U ˘ 2 , ρ ¨ ) be a LDF-RAS and Y 1 , Y 2 are any non-empty subsets of U ˘ 2 . Then, A-M and R-M of Y 1 , Y 2 , Y 1 Y 2 and Y 1 Y 2 the following relations;
(1) 
M R ( Y 1 Y 2 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ | M R ( Y 1 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ | +
M R ( Y 2 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ | M R ( Y 1 Y 2 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ | ;
(2) 
M A ( Y 1 Y 2 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ | M A ( Y 1 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ | +
M A ( Y 2 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ | M A ( Y 1 Y 2 ) | a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 1 ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y 2 ) ¯ |
Proof. 
The proof resembles that of Theorem 3.3 in [51]. □

6. An Application of LDF-RSs on Two Different Universes

In the literature, a number of scientists have developed various techniques for medical diagnosis. Sun and Ma [48] presented an application of the F-RS model on two distinct domains in clinical diagnosis systems. Since the information is insufficient in the case of F-RS, Yang et al. [51] expanded the idea of Sun and Ma [48] to BF-RS model on two distinct cosmologies. LD-FSs are more efficient in decision analysis than the prevailing concepts of FS, IF-S, B-FS and q-ROF-S. Therefore, we need to extend the existing technique of BF-RS to a more general and robust model, namely LDF-RS on two contrasting universes and utilize this notion in clinical diagnosis.
Suppose that U ˘ 1 refers to the collection of afflicted people and U ˘ 2 indicates the group of symptoms. Let P ¨ = ( U ˘ 1 , U ˘ 2 , ρ ¨ ) be LDF-RAS. If ( v 1 , v 2 ) ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > , for all v 1 U ˘ 1 and v 2 U ˘ 2 , then we say that the sufferer x has the symptom y and the percentage of the patient who exhibits symptom y is at least s ¨ and the degree of its corresponding parameter is not less than u ¨ , the sufferer’s degree of symptom y non-existence is not greater than t ¨ , and the degree of its corresponding parameter is not greater than v ¨ .
We are aware that a certain illness has a number of common symptoms. We denote a certain disease by Y = { y i U ˘ 2 : i I } for any Y U ˘ 2 and make the following inferences using the PR, NR, and BR described in Definition 11:
Let v U ˘ 1 be a given certain sufferer. Then,
(1)
If v L D F P O S P ¨ ( Y ) = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ and v ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > , that is, he must have illness Y , at which point the patient urgently requires treatment.
(2)
If v L D F B N D P ¨ ( Y ) = a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ¯ a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ̲ , consequently, he will be the doctor’s second choice because he is not diagnosed based on these symptoms, even though he may have the disease Y .
(3)
If v LDF N E G P ¨ ( Y ) , that is, v ( a p p r ρ ¨ < s ¨ , u ¨ > < t ¨ , v ¨ > ( Y ) ) c ¯ , consequently, he does not have illness Y and does not require treatment.
Let us use a specific case to demonstrate this.
Example 5. 
Let U ˘ 1 = { p 1 , p 2 , p 3 , p 4 } be the group of certain victims and U ˘ 2 = { q 1 , q 2 , q 3 } be the set of some symptoms. Consider an LDF-R ρ ¨ from U ˘ 1 to U ˘ 2 . It describes the M and NM grades, together with the grades of their parameters, for each patient p i in relation to the symptom q j in the following matrices:
Θ M = 0.80 0.54 0.68 0.71 0.45 0.40 0.57 0.36 0.75 0.85 0.81 0.62 , Θ N = 0.35 0.46 0.38 0.36 0.72 0.43 0.46 0.56 0.47 0.21 0.32 0.25 ,
ϖ M = 0.71 0.50 0.62 0.62 0.38 0.30 0.46 0.26 0.60 0.80 0.78 0.59 , β = 0.24 0.48 0.38 0.38 0.52 0.70 0.54 0.66 0.40 0.20 0.18 0.28 .
Let Y = { q 1 , q 2 } symbolize a specific sickness, and there are two signs of this condition in clinic.
Case-1: For s ¨ = 0.45 , u ¨ = 0.38 and t ¨ = 0.72 , v ¨ = 0.52 , we have:
p 1 ρ ¨ < 0.45 , 0.38 > < 0.72 , 0.52 > = p 4 ρ ¨ < 0.45 , 0.38 > < 0.72 , 0.52 > = U ˘ 2 , p 2 ρ ¨ < 0.45 , 0.38 > < 0.72 , 0.52 > = { q 1 , q 2 } , p 3 ρ ¨ < 0.45 , 0.38 > < 0.72 , 0.52 > = { q 3 }
(see Definition 8). By simple computations, the L-A and U-A of Y are given below:
a p p r ρ ¨ < 0.45 , 0.38 > < 0.72 , 0.52 > ( Y ) ̲ = { p 2 } , a p p r ρ ¨ < 0.45 , 0.38 > < 0.72 , 0.52 > ( Y ) ¯ = { p 1 , p 2 , p 4 }
Using Definition 10, L D F P O S P ¨ ( Y ) = { p 2 } , L D F B N D P ¨ ( Y ) = { p 1 , p 4 } and L D F N E G P ¨ ( Y ) = { p 3 } . Furthermore, by Definition 12, the A-M and R-M are calculated as:
M A ( Y ) = 1 3 , M R ( Y ) = 2 3
Thus, we interpret the subsequent results:
(1) 
Patient p 2 must be afflicted with illness Y and requires emergency medical attention.
(2) 
We cannot guarantee that patients p 1 and p 4 are suffering from illness Y based on these symptoms. The doctor will therefore choose the second option.
(3) 
The sickness Y does not affect patient p 3 .
Case-2: For s ¨ = 0.57 , u ¨ = 0.46 and t ¨ = 0.46 , v ¨ = 0.54 , we have:
p 1 ρ ¨ < 0.57 , 0.46 > < 0.46 , 0.54 > = { q 1 , q 3 } , p 2 ρ ¨ < 0.57 , 0.46 > < 0.46 , 0.54 > = { q 1 } = p 3 ρ ¨ < 0.57 , 0.46 > < 0.46 , 0.54 > , p 4 ρ ¨ < 0.57 , 0.46 > < 0.46 , 0.54 > = U ˘ 2 .
(using Definition 8). By simple calculations, the L- and U-As of Y are as follows:
a p p r ρ ¨ < 0.57 , 0.46 > < 0.46 , 0.54 > ( Y ) ̲ = { p 2 , p 3 } , a p p r ρ ¨ < 0.57 , 0.46 > < 0.46 , 0.54 > ( Y ) ¯ = U ˘ 2
Using Definition 10, LDF P O S P ¨ ( Y ) = { p 2 , p 3 } , LDF B N D P ¨ ( Y ) = { p 1 , p 4 } and LDF N E G P ¨ ( Y ) = . Further, using Definition 12, the A-M and R-M are computed as follows:
M A ( Y ) = 1 2 , M R ( Y ) = 1 2
Thus, we conclude that:
(1) 
Patients p 2 a n d p 3 must endure illness Y , and he requires prompt medical attention.
(2) 
Regarding patients p 1 and p 4 , we cannot guarantee whether or not they are experiencing the symptoms of illness Y . The doctor will therefore choose the second option.
(3) 
No one who suffers has a healthy diagnosis.
Remark 3. 
(⋄)
Based on the analysis discussed earlier, we may infer that decision precision rises with approximation precision, as in [51]. Thus, a precise decision can be made by a doctor using the proposed method of LDF-RSs.
(⋄)
Furthermore, our proposed technique of LDF-RSs allows reducing the likelihood of a surgical misconception.
(⋄)
Additionally, the LDF-RS model, and because of the application of control or reference factors found in LD-FSs, the applied approach may help decision-makers arrive at a precise and scientific conclusion in circumstances where they frequently encounter one another.

Comparative Analysis

In this section, we contrast our findings with a few of Yang et al. [51], Sun and Ma [48] and Ayub et al.’s [52] previously used methods.
Example 6. 
For [48], consider our previous Example 5, where U ˘ 1 = { p 1 , p 2 , p 3 , p 4 } and U ˘ 2 = { q 1 , q 2 , q 3 } . The following describes the M grades for each patient p i in connection to the symptom q j and F-R Θ M on U ˘ 1 × U ˘ 2 :
Θ M = 0.80 0.54 0.68 0.71 0.45 0.40 0.57 0.36 0.75 0.85 0.81 0.62 ,
Using Definition 3.3 of [48] for level cuts, we obtain the following for s ¨ = 0.45 :
p 1 Θ 0.45 M = p 4 Θ 0.45 M = U ˘ 2 , p 3 Θ 0.45 M = { q 1 , q 3 } , p 2 Θ 0.45 M = { q 1 , q 2 }
For Y = { q 1 , q 2 } , the L- and U-As are obtained by using Definition 3.3 of [48] below:
a p p r Θ 0.45 M ̲ ( Y ) = { p 2 } , a p p r Θ 0.45 M ¯ ( Y ) = U ˘ 2
Therefore, P R ( Y ) = { p 2 } , B R ( Y ) = { p 1 , p 3 , p 4 } and N R ( Y ) = . As a result, the following conclusions may be made from this information:
(1) 
Patient p 2 needs immediate medical care as he must deal with the sickness Y .
(2) 
We are unable to confirm if patients p 1 , p 3 , and p 4 are displaying the signs of sickness Y . Therefore, the doctor will select choice number two.
(3) 
Nobody who is ill has a clear diagnosis.
For s ¨ = 0.57 , we have:
p 1 Θ 0.57 M = p 3 Θ 0.57 M = { q 1 , q 3 } , p 2 Θ 0.57 M = { q 1 } , p 4 Θ 0.57 M = U ˘ 2
The L- and U-As for Y are found by applying Definition 3.3 of [48] below:
a p p r Θ 0.57 M ̲ ( Y ) = { p 3 } , a p p r Θ 0.57 M ¯ ( Y ) = U ˘ 2
Therefore, P R ( Y ) = { p 3 } , B R ( Y ) = { p 1 , p 2 , p 4 } and N R ( Y ) = . Thus, it follows that:
(1) 
Patient p 3 is suffering from illness Y and needs immediate medical care.
(2) 
We are unable to confirm if patients p 1 , p 2 , and p 4 are displaying the signs of sickness Y . Therefore, the doctor will select choice number two.
(3) 
There is no healthy diagnosis for someone who is suffering.
Example 7. 
We use the same Example 5 with BF-R which is expressed in the Table 1 for [51]:
Using Definition 3.1 of [51], the < s ¨ , t ¨ > level cuts for s ¨ = 0.45 and t ¨ = 0.54 , we have the sequel:
p 1 ( ρ B ) < 0.45 , 0.54 > = p 4 ( ρ B ) < 0.45 , 0.54 > = U 2 , p 2 ( ρ B ) < 0.45 , 0.54 > = { q 1 , q 2 } , p 3 ( ρ B ) < 0.45 , 0.54 > = { q 3 }
From Definition 3.2 of [51], the L-, and U-As of Y are given below:
a p p r ( ρ B ) < 0.45 , 0.54 > ̲ ( Y ) = { p 2 } , a p p r ( ρ B ) < 0.45 , 0.54 > ¯ ( Y ) = { p 1 , p 2 , p 4 }
Therefore, P R ( Y ) = { p 2 } , B R ( Y ) = { p 1 , p 4 } and N R ( Y ) = { p 3 } . Thus, based on these findings, the following inferences can be made:
(1) 
Patient p 2 must suffer from disease Y , so he requires urgent medical attention.
(2) 
We are uncertain as to whether patients p 1 and p 4 are exhibiting the signs of sickness Y . Therefore, the doctor will select choice number two.
(3) 
Patient p 3 was declared to be in good health and does not require any additional care.
Now, for s ¨ = 0.57 and t ¨ = 0.40 , using Definition 3.1 of [51] for < s ¨ , t ¨ > level cuts, we obtain the following:
p 1 ( ρ B ) < 0.45 , 0.54 > = p 3 ( ρ B ) < 0.45 , 0.54 > = { q 1 , q 3 } , p 2 ( ρ B ) < 0.45 , 0.54 > = { q 1 } , p 4 ( ρ B ) < 0.45 , 0.54 > = U 2
By using Definition 3.2 of [51] and simple calculations, we obtain the L-A and U-A of Y in the sequel:
a p p r ( ρ B ) < 0.57 , 0.40 > ̲ ( Y ) = { p 2 } , a p p r ( ρ B ) < 0.57 , 0.40 > ¯ ( Y ) = U 2
Therefore, P R ( Y ) = { p 2 } , B R ( Y ) = { p 1 , p 3 , p 4 } and N R ( Y ) = . Based on these results, we conclude that:
(1) 
Patient p 2 has to have illness Y , so he needs to get medical help right away.
(2) 
We cannot guarantee that patients p 1 , p 3 , and p 4 are displaying the signs of sickness Y or not. Therefore, the doctor will select choice number two.
(3) 
Nobody who is in pain has a good diagnosis.
Example 8. 
For [52], consider the same LDF-R as in Example 5. By using Definition 9 of [52], we obtain the L-, and U-As for Y = { q 1 , q 2 } and s ¨ = 0.45 , u ¨ = 0.38 as follows:
ρ ¨ ( Y ) ̲ < 0.45 , 0.38 > = { p 2 } , ρ ¨ ( Y ) ¯ < 0.45 , 0.38 > = U 1
For t ¨ = 0.72 and v ¨ = 0.52 , the L-A and U-A are as follows:
ρ ¨ ( Y ) ̲ < 0.72 , 0.52 > = { p 1 , p 2 , p 4 } , ρ ¨ ( Y ) ¯ < 0.72 , 0.52 > =
Thus, P R ( Y ) = ( { p 2 } , ) , B R ( Y ) = ( { p 1 , p 3 , p 4 } , { p 1 , p 2 , p 4 } ) and N R ( Y ) = ( , { p 3 } ) . These findings allow for the following inferences:
(1) 
Patient p 2 must deal with the ailment Y , necessitating immediate medical attention. Since there is no other patient in the area, we can declare with certainty that this patient does not have illness Y .
(2) 
We cannot ensure that patients p 1 , p 3 , and p 4 are exhibiting the symptoms of sickness Y . Consequently, the doctor will pick option number two.
(3) 
Nobody who is in pain has a good diagnosis.
Now, for s ¨ = 0.57 , u ¨ = 0.46 the L-, and U-As are as follows:
ρ ¨ ( Y ) ̲ < 0.57 , 0.46 > = { p 2 } , ρ ¨ ( Y ) ¯ < 0.45 , 0.38 > = U 1
For t ¨ = 0.46 and v ¨ = 0.54 , the L-A and U-As of Y are as follows:
ρ ¨ ( Y ) ̲ < 0.46 , 0.54 > = U 1 , ρ ¨ ( Y ) ¯ < 0.46 , 0.54 > =
Thus, P R ( Y ) = ( { p 2 } , ) , B R ( Y ) = ( { p 1 , p 3 , p 4 } , U 1 ) and N R ( Y ) = ( , ) . These lead us to conclude that:
(1) 
Patient p 2 must deal with ailment Y , necessitating immediate medical attention. Since there is no other patient in the area, we can declare with certainty that this patient does not have illness Y .
(2) 
We cannot confirm whether patients p 1 , p 3 , and p 4 are exhibiting the signs of sickness Y . As a result, the doctor will go with option number two.
(3) 
No one with a diagnosis of illness is healthy.

7. Conclusions

The concept of LD-FS is a very powerful and convenient tool to describe the uncertainties in many practical problems, which involves decisions. The decision makers can freely choose the degree of truthness and the degree of falsity by making the use of reference or control parameters. Thus, LD-FS enhanced the space of truthness degree and falsity degree and removed the limitations of these degrees as in the existing concepts of FS, IF-S, B-FS, P-FS and q-ROF-S. In this paper, the existing notions of the F-RS model and BF-RS model on two universes have been generalized into the LDF-RS model on two universes as a more convenient and a robust model. The basic notions of lower and upper LDF-RAS have been defined by employing the after sets and fore sets of the ( < s ¨ , u ¨ > , < t ¨ , v ¨ > ) -level cut relation of an LDF-Rs. Some important results related to the L- and U-As have been proved with illustrative examples. Furthermore, to illustrate the application of LDF-RSs, an example has been employed. Further research on the proposed ideas of this research paper applied to other practical applications is needed, which may lead to many fruitful outcomes.

Author Contributions

S.A., M.S. and M.R., contributed to the investigation, methodology, and writing—original draft preparation. F.K., D.M. and D.V., contributed to the supervision, investigation, and funding acquisition. S.A. contributed to the application, formal analysis, and data analysis. All authors have read and agreed to the published version of the manuscript.

Funding

Support has been received from the German Research Foundation and the TU Berlin.

Data Availability Statement

This manuscript contains hypothetical data and can be used by anyone by citing this article.

Acknowledgments

The authors wish to acknowledge the support received from the German Research Foundation and the TU Berlin.

Conflicts of Interest

The authors declare that they have no conflict of interest regarding the publication of the research article.

References

  1. Zadeh, L.A. Fuzzy Sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanssov, K.T. Intuintionistic Fuzzy Sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Atanssov, K.T. More on Intuintionistic Fuzzy Sets. Fuzzy Sets Syst. 1989, 33, 37–45. [Google Scholar] [CrossRef]
  4. Zhang, W.R. Bipolar fuzzy sets and relations: A computational framework for cognitive modeling and multiagent decision analysis. In Proceedings of the Industrial Fuzzy Control and Intelligent Systems Conference, and The NASA Joint Technology Workshop on Neural Networks and Fuzzy Logic and Fuzzy Information Processing Society Biannual Conference, San Antonio, TX, USA, 18–21 December 1994; pp. 305–309. [Google Scholar]
  5. Yager, R.P. Pythagorean fuzzy subsets. In Proceedings of the IFSA World Congress and NAFIPS Anual Meeting, Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  6. Yager, R.P. Pythagorean membership grades in multi-criteria decision maiking. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  7. Yager, R.P. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2017, 25, 1222–1230. [Google Scholar] [CrossRef]
  8. Riaz, M.; Hashmi, M.R. Linear Diophantine fuzzy set and its applications towards multi-attribute decision-making problems. J. Intell. Fuzzy Syst. 2019, 37, 5417–5439. [Google Scholar] [CrossRef]
  9. Almagrabi, A.O.; Abdullah, S.; Shams, M. A new approach to q-linear Diophantine fuzzy emergency decision support system for COVID19. J. Ambient. Intell. Humaniz. Comput. 2022, 13, 1687–1713. [Google Scholar] [CrossRef]
  10. Kamaci, H. Linear Diophantine fuzzy algebraic structures. J. Ambient. Intell. Humaniz. Comput. 2021, 12, 10353–10373. [Google Scholar] [CrossRef]
  11. Riaz, M.; Hashmi, M.R.; Kulsoom, H.; Pamucar, D.; Chu, Y.M. Linear Diophantine fuzzy soft rough sets for the selection of sustainable material handling equipment. Symmetry 2020, 12, 1215. [Google Scholar] [CrossRef]
  12. Ayub, S.; Shabir, M.; Riaz, M.; Aslam, M.; Chinram, R. Linear Diophantine Fuzzy relations and their algebraic properties with decision making. Symmetry 2021, 13, 945. [Google Scholar] [CrossRef]
  13. Zadeh, L.A. Similarity Relations and Fuzzy Orderings. Inf. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef]
  14. Wang, X.Z.; Ruan, D.; Kerre, E.E. Mathematics of fuzziness-Basic Issues. In Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2009; Volume 245, pp. 1–227. [Google Scholar]
  15. Atanassov, K.T. Intuitionistic Fuzzy Relations (IFRs). In On Intuitionistic Fuzzy Sets Theory. Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2012; Volume 283, pp. 147–193. [Google Scholar] [CrossRef]
  16. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  17. Hashmi, M.R.; Riaz, M.; Smarandache, F. m-polar neutrosophic topology with applications to multi-criteria decision-making in medical diagnosis and clustering analysis. Int. J. Fuzzy Syst. 2020, 22, 273–292. [Google Scholar] [CrossRef]
  18. Pawlak, Z. Rough sets. Int. J. Inf. Comp. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  19. Pawlak, Z. Rough Sets-Theoretical Aspects of Reasoning Anout Data; Kluwer Academic Publishing: Dordrecht, The Netherlands, 1991. [Google Scholar]
  20. Yao, Y.Y. Constructive and algebraic methods of the theory of rough sets. Inf. Sci. 1998, 109, 21–47. [Google Scholar] [CrossRef]
  21. Zhu, W. Generalized rough sets based on relations. Inf. Sci. 2007, 177, 4997–5011. [Google Scholar] [CrossRef]
  22. Davvaz, B. A short note on algebraic T-rough sets. Inf. Sci. 2008, 178, 3247–3252. [Google Scholar] [CrossRef]
  23. Skowron, A.; Stepaniuk, J. Tolerance approximation spaces. Fundam. Inform. 1996, 27, 245–253. [Google Scholar] [CrossRef]
  24. Slowinski, R.; Vanderpooten, D. Similarity relation as a basis for rough approximations. ICS Res. Rep. 1995, 53, 249–250. [Google Scholar]
  25. Qin, K.; Yang, J.; Pei, Z. Generalized rough sets baased on reflexive and transitive relations. Inf. Sci. 2008, 178, 4138–4141. [Google Scholar] [CrossRef]
  26. Kanwal, R.S.; Shabir, M. Roughness in semigroups by soft binary relations. J. Intell. Fuzzy Syst. 2018, 35, 1–14. [Google Scholar]
  27. Li, Z.; Xie, N.; Gao, N. Rough approximations based on soft binary relations and knowledge bases. Soft Comput. 2017, 21, 839–852. [Google Scholar] [CrossRef]
  28. Ali, M.I. A note on soft sets, rough soft sets, fuzzy soft sets. Appl. Soft. Comput. 2011, 11, 3329–3332. [Google Scholar]
  29. Qian, Y.; Liang, J.; Yao, Y.; Dang, C. MGRS: A Multigranulation rough set. Inf. Sci. 2010, 180, 949–970. [Google Scholar] [CrossRef]
  30. Ayub, S.; Shabir, M.; Mahmood, W. New types of soft rough sets in groups by normal soft groups. Comput. Appl. Math. 2020, 39, 67. [Google Scholar] [CrossRef]
  31. Zhan, J.; Alcantud, J.C.R. A novel type of soft rough covering and its application to multicriteria group decision making. Artif. Intell. Rev. 2019, 52, 2381–2410. [Google Scholar] [CrossRef]
  32. Feng, F.; Akram, M.; Davvaz, B.; Leoreanu-Fotea, V. Attribute analysis of information systems based on elementary soft implications. Knowl.-Based Syst. 2014, 70, 281–292. [Google Scholar] [CrossRef]
  33. Riaz, M.; Farid, H.M.A. Picture fuzzy aggregation approach with application to third-party logistic provider selection process. Rep. Mech. Eng. 2022, 3, 318–327. [Google Scholar] [CrossRef]
  34. Ashraf, A.; Ullah, K.; Hussain, A.; Bari, M. Interval-Valued Picture Fuzzy Maclaurin Symmetric Mean Operator with application in Multiple Attribute Decision-Making. Rep. Mech. Eng. 2022, 3, 301–317. [Google Scholar] [CrossRef]
  35. Ali, Z.; Mahmood, T.; Ullah, K.; Khan, Q. Einstein Geometric Aggregation Operators using a Novel Complex Interval-valued Pythagorean Fuzzy Setting with Application in Green Supplier Chain Management. Rep. Mech. Eng. 2021, 2, 105–134. [Google Scholar] [CrossRef]
  36. Zhou, B.; Chen, J.; Wu, Q.; Pamucar, D.; Wang, W.; Zhou, L. Risk priority evaluation of power transformer parts based on hybrid FMEA framework under hesitant fuzzy environment. Facta Univ. Ser. Mech. Eng. 2022, 20, 399–420. [Google Scholar] [CrossRef]
  37. Ayub, S.; Mahmood, W.; Shabir, M.; Nabi, F.G. Applications of roughness in soft-intersection groups. Comput. Appl. Math. 2019, 8, 1–16. [Google Scholar] [CrossRef]
  38. Chen, Z.; Ayub, S.; Mahmood, W.; Mahmood, A.; Jung, C.Y. A study of roughness in modules of fractions. IEEE Access 2019, 7, 93088–93099. [Google Scholar] [CrossRef]
  39. Karamaşa, C.; Karabasevic, D.; Stanujkic, D.; Kookhdan, A.; Mishra, A.; Ertürk, M. An extended single-valued neutrosophic AHP and MULTIMOORA method to evaluate the optimal training aircraft for flight training organizations. Facta Univ. Ser. Mech. Eng. 2021, 19, 555–578. [Google Scholar] [CrossRef]
  40. Osintsev, N.; Rakhmangulov, A.; Baginova, V. Evaluation of logistic flows in green supply chains based on the combined DEMATEL-ANP method. Facta Univ. Ser. Mech. Eng. 2021, 19, 473–498. [Google Scholar] [CrossRef]
  41. Mahmood, W.; Nazeer, W.; Kang, S.K. The lower and upper approximations and homomorphisms between lower and upper approximations in quotient groups. J. Intell. Fuzzy Syst. 2017, 33, 2585–2594. [Google Scholar] [CrossRef]
  42. Mahmood, W.; Ahmad, M.S.; Nazeer, W.; Kang, S.M. A comparision between lower and upper approximations in groups with respect to group homomorphisms. J. Intell. Fuzzy Syst. 2018, 35, 1–11. [Google Scholar]
  43. Shabir, M.; Shaeen, T. A new methodolgy for fuzzification of rough sets based on α-indiscernibility. Fuzzy Sets Syst. 2016, 16, 1–19. [Google Scholar] [CrossRef]
  44. Tsang, E.C.; Chen, D.; Yeung, D.S.; Wang, X.Z.; Lee, J.W. Attributes reduction using fuzzy rough sets. IEEE Trans. Fuzzy Syst. 2008, 16, 1130–1141. [Google Scholar] [CrossRef]
  45. Dubois, D.; Prade, H. Fuzzy rough sets and rough fuzzy sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef]
  46. Gul, R.; Shabir, M. Roughness of a set by (α,β)-indiscernibility of Bipolar fuzzy relation. Comput. Appl. Math. 2020, 39, 1–22. [Google Scholar] [CrossRef]
  47. Liu, G.L. Rough set theory based on two universal sets and its applications. Knowl. Based Syst. 2010, 23, 110–115. [Google Scholar] [CrossRef]
  48. Sun, B.Z.; Ma, W.M. Fuzzy rough set model on two different universes and its applications. Appl. Math. Model. 2011, 35, 1798–1809. [Google Scholar] [CrossRef]
  49. Li, T.J.; Zhang, W.X. Rough fuzzy approximations on two universes of discourse. Inf. Sci. 2008, 178, 892–906. [Google Scholar] [CrossRef]
  50. Yang, H.L. A note on Rough set theory based on two universal sets and its applications. Knowl.-Based Syst. 2010, 24, 465–466. [Google Scholar] [CrossRef]
  51. Yang, H.L.; Li, S.G.; Wang, S.; Wang, J. Bipolar fuzzy rough set model on two different universes and it applications. Knowl.-Based Syst. 2012, 35, 94–101. [Google Scholar] [CrossRef]
  52. Ayub, S.; Shabir, M.; Riaz, M.; Mahmood, W.; Bozanic, D.; Marinkovic, D. Linear Diophantine Fuzzy Rough Sets: A New Rough Set Approach with Decision Making. Symmetry 2022, 14, 525. [Google Scholar] [CrossRef]
Table 1. ρ B .
Table 1. ρ B .
U 1 U 2 q 1 q 2 q 3
p 1 < 0.80 , 0.20 > < 0.54 , 0.46 > < 0.68 , 0.30 >
p 2 < 0.71 , 0.25 > < 0.45 , 0.45 > < 0.40 , 0.43 >
p 3 < 0.57 , 0.40 > < 0.36 , 0.56 > < 0.75 , 0.25 >
p 4 < 0.85 , 0.12 > < 0.81 , 0.15 > < 0.62 , 0.25 >
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ayub, S.; Shabir, M.; Riaz, M.; Karaaslan, F.; Marinkovic, D.; Vranjes, D. Linear Diophantine Fuzzy Rough Sets on Paired Universes with Multi Stage Decision Analysis. Axioms 2022, 11, 686. https://doi.org/10.3390/axioms11120686

AMA Style

Ayub S, Shabir M, Riaz M, Karaaslan F, Marinkovic D, Vranjes D. Linear Diophantine Fuzzy Rough Sets on Paired Universes with Multi Stage Decision Analysis. Axioms. 2022; 11(12):686. https://doi.org/10.3390/axioms11120686

Chicago/Turabian Style

Ayub, Saba, Muhammad Shabir, Muhammad Riaz, Faruk Karaaslan, Dragan Marinkovic, and Djordje Vranjes. 2022. "Linear Diophantine Fuzzy Rough Sets on Paired Universes with Multi Stage Decision Analysis" Axioms 11, no. 12: 686. https://doi.org/10.3390/axioms11120686

APA Style

Ayub, S., Shabir, M., Riaz, M., Karaaslan, F., Marinkovic, D., & Vranjes, D. (2022). Linear Diophantine Fuzzy Rough Sets on Paired Universes with Multi Stage Decision Analysis. Axioms, 11(12), 686. https://doi.org/10.3390/axioms11120686

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