Relative Sets and Rough Sets
International Journal of Applied Mathematics and Computer Science, Tome 11 (2001) no. 3, pp. 637-653
Cet article a éte moissonné depuis la source Library of Science
In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic. Like truth-values of Belnap's logic, relative sets have two orderings; one is an order of inclusion and the other is an order of knowledge or information. By defining a rough set as a pair of definable sets, an integrated approach to relative sets and rough sets is obtained. With this definition, we are able to define an approximation of a rough set in an approximation space, and so we can obtain sequential approximations of a set, which is a good model of communication among agents.
Keywords:
rough sets, set theory, data analysis, multi-valued logic, interval sets, knowledge representation
Mots-clés : teoria mnogości, analiza danych, przedstawienie wiedzy
Mots-clés : teoria mnogości, analiza danych, przedstawienie wiedzy
@article{IJAMCS_2001_11_3_a4,
author = {Mousavi, A. and Jabedar-Maralani, P.},
title = {Relative {Sets} and {Rough} {Sets}},
journal = {International Journal of Applied Mathematics and Computer Science},
pages = {637--653},
year = {2001},
volume = {11},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IJAMCS_2001_11_3_a4/}
}
Mousavi, A.; Jabedar-Maralani, P. Relative Sets and Rough Sets. International Journal of Applied Mathematics and Computer Science, Tome 11 (2001) no. 3, pp. 637-653. http://geodesic.mathdoc.fr/item/IJAMCS_2001_11_3_a4/