Pawlak tackled uncertain knowledge in the fields of AI information systems, and cognitive sciences in areas including ML, knowledge acquisition, and decision analysis at the start of the 1980s, among others, by utilizing the concept of RSs and its approximations (LAs and UAs) spaces in his papers [1-5]. The relationship between RSs and algebraic systems (structures) was formed via investigation and creativity. As a result, several concepts were introduced by various authors.
Numerous arbitrary binary relations, motivated by Pawlak's rough set and induced by an equivalence relation, have been used to study vast concepts. indicates a successor neighborhood of u produced by a binary relation on a universal set U in which u is an element of U. Yao, suggested roughness models based on binary-induced successor neighborhoods [6]. A framework based on binary relations was given for analyzing neighborhood systems and RS approximations, and he explored the features of neighborhood and approximation operators and their relationships. If u is an element in X, then denotes the core successor neighborhood generated by a binary relation on a universal set X. RSs were proposed as core successor neighborhoods resulting from binary relations by Mareay [7]. If the property of being an equivalence relation is present in a binary relation on a universal set, then Mareay's RSs and Yao's RSs are extensions of Pawlak's RSs.
In what may be regarded as the notion of roughness in classical algebras, Kuroki, presented roughness in semigroups and its ideals [8]. The concept of rough groups and rough subgroups was later established by Biswas and Nanda [9]. Li and Yin, proposed and T-UA fuzzy rough approximation operators on a semigroup, whereas Qi and Liu, investigated the ideas of rough approximation in Boolean algebras [10-11]. It was Davvaz, who first proposed the idea of roughness in rings [12].
Rough set theory (RST) was studied by Ameri, in relation to hyper BCK-algebras and by Dudek, in relation to hyper BCI-algebras [13-14]. Roughness concepts in BCC algebras have also been studied by Jun [15]. The origin of FSs goes back to 1965, when they were first developed by Zadeh [16]. Since then, it has been the subject of numerous studies by many authors in several scientific, technical, and engineering fields. Fuzziness, and forms of logical algebras are recent developments and topics of interest for many writers and researchers [17-20].
A number of authors are among them. In recent years, Rough fuzzy ideals in BCK/BCI algebras were investigated by Ahn, and others. Understanding the many kinds and orientations of applied algebras has been largely based on logical and classical algebras [21]. This is particularly true for artificial intelligence related computer systems that simulate how a person would handle the certainty and uncertainty of information using logical approaches [22]. Using these notions to tackle challenges is made easy by these tactics. BCI/BCK algebras and BL-algebras are two important categories of fundamental logical algebras [23].
Perfect BL-algebras, local BL-algebras, SBL-algebras, and all of its variations have been the subject of several investigations. Whether or not they have hyperstructures, these ideas relate to roughness and softness in an intriguing way. Impan introduced the roughness notion lately, and it has been used to UA-algebras [24]. UA-algebras are subject to a number of traditional theorems from RST, and related findings have been analyzed using this idea. A UA-algebra's rough ideal characteristics have been demonstrated using lower approximations (LAs) and upper approximations (UAs). It is demonstrated that a strong UA-ideal is once again a strong ideal in terms of a UA- algebra's UAs and Las.
The motivation for this study is to link the fuzzy relational uncertainty with algebraic roughness closer. The RSs approach is successfully applied in various algebraic systems, but the FR induced CSCs and JU-algebraic systems have not been systematically studied.
The present research deals with the problem of constructing rough JU-substructures and analyzing their algebraic attributes of CSCs based on FRs and its RS approaches, which were developed for a few logical algebras.
It is not sufficient to define lower and upper approximations on a JU-algebra. It also needs to be determined whether they are compatible with the algebraic operation. Thus, the aim of this study is to investigate the preservation of JU-subalgebras, JU-ideals, weak JU-ideals and strong JU-ideals under the proposed approximations.
Fuzzy relationships allow to directly address the consideration of uncertain relationships between the two universes in the approximation process. CSCs give the corresponding information granules to build the lower and upper approximations.
The framework is then extended to quantales, to see if the algebraic structure proposed above is compatible with a richer complete-lattice based algebraic structure. The quantale extension is concerned with rough JU-ideals, weak JU-ideals and strong JU-ideals.
This question is different from transferring an already known rough-set definition to another algebraic structure. Rather, the mathematical relationships and interactions between fuzzy relational granulation, the CSC-based approximation operators and the algebraic preservation properties are emphasized.
This is a summary of the paper organization. The preliminary result and some of the basic definitions necessary for the subsequent analysis are given in Materials and Methods. The principal theoretical results are extended to quantales, the development of the CSC-based rough JU-substructures under fuzzy relations is carried out in Results. 4. Comparative analysis and Discussion, discusses how the proposed framework compares with the current approaches. Finally, the paper ends with Conclusion that summarizes the findings and provides some directions for future research.
JU-algebras, JU-subalgebras, and JU-ideals are some of the fundamental definitions that will be covered in this part, along with some associated fundamental findings and examples. These discoveries will support our efforts.