.png){kind=icon}
.png){kind=icon}
Return
Rough approximations based on soft binary relations and knowledge bases
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-016-2077-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies rough approximations based on soft binary relations. Firstly, two pairs of rough approximations based on soft binary relations are investigated, and their properties are determined. Secondly, rough sets with respect to some parameter and the set of parameters are introduced, and the fact that every rough set is a special case of E-rough sets where E is the set of parameters is demonstrated. Thirdly, rough soft sets induced by soft binary relations are proposed, and their lattice structures are given. Fourthly, two kinds of topologies induced by soft reflexive relations are investigated. Finally, the fact that there exists a one-to-one correspondence between the family of all knowledge bases and the family of all soft equivalence relations is proved, and soft characterizations of knowledge structures in knowledge bases are provided, which shows that we can study knowledge bases using soft set theory.
Keywords:
Rough approximation
Rough set
Soft binary relation
Topology
Knowledge base
Knowledge structure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.