×

Relational interpretations of neighborhood operators and rough set approximation operators. (English) Zbl 0949.68144

The author presents a generalization of the rough set approach by introducing neighborhood systems defined by binary relations. For each object of the universe of such a system a nonempty family of subsets of the universe is associated. Some relationships with modal logic are summarized. The neighborhood systems are then used to define and study the basic properties of set approximations.

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
03E72 Theory of fuzzy sets, etc.
68T27 Logic in artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Chellas, B.F., Modal logic: an introduction, (1980), Cambridge University Press Cambridge · Zbl 0431.03009
[2] Cohn, P.M., Universal algebra, (1965), Harper & Row New York · Zbl 0141.01002
[3] Koczy, L.T., Review of “on a concept of rough sets” by zakowski, Mathematical review, 84i, 03092, (1984)
[4] Lin, T.Y., Neighborhood systems and relational database, () · Zbl 0927.68089
[5] Lin, T.Y., Neighborhood systems and approximation in database and knowledge base systems, ()
[6] Lin, T.Y., Topological and fuzzy rough sets, (), 287-304
[7] Lin, T.Y., Neighborhood systems — application to qualitative fuzzy and rough sets, (), 132-155
[8] Lin, T.Y.; Liu, Q., Rough approximate operators: axiomatic rough set theory, (), 256-260 · Zbl 0818.03028
[9] Lin, T.Y.; Liu, Q.; Huang, K.J.; Chen, W., Rough sets, neighborhood systems and approximation, (), 130-141
[10] Lin, T.Y.; Yao, Y.Y., Mining soft rules using rough sets and neighborhoods, (), 1095-1100
[11] Orlowska, E., Semantics of nondeterministic possible worlds, Bulletin of the Polish Academy of sciences: mathematics, 33, 453-458, (1985) · Zbl 0584.03012
[12] Orlowska, E., Semantics analysis of inductive reasoning, Theoretical computer science, 43, 81-89, (1986) · Zbl 0601.68059
[13] Orlowska, E., Kripke semantics for knowledge representation logics, Studia logica, 49, 255-272, (1990) · Zbl 0726.03023
[14] Pawlak, Z., Rough sets, International journal of computer and information science, 11, 341-356, (1982) · Zbl 0501.68053
[15] Pawlak, Z., Rough classification, International journal of man-machine studies, 20, 469-483, (1984) · Zbl 0541.68077
[16] Pawlak, Z., Rough sets: A new approach to vagueness, (), 105-118
[17] Pawlak, Z., Hard and soft sets, (), 130-135 · Zbl 0819.04008
[18] Pomykala, J.A., Approximation operations in approximation space, Bulletin of the Polish Academy of sciences: mathematics, 35, 653-662, (1987) · Zbl 0642.54002
[19] Pomykala, J.A., On definability in the nondeterministic information system, Bulletin of the Polish Academy of sciences: mathematics, 36, 193-210, (1988) · Zbl 0677.68110
[20] Sierpenski, W.; Krieger, C., General topology, (1956), University of Toronto Toronto
[21] Slowinski, R.; Vanderpooten, D., Similarity relation as a basis for rough approximations, (), 17-33
[22] Wasilewska, A., Conditional knowledge representation systems — model for an implementation, Bulletin of the Polish Academy of sciences: mathematics, 37, 63-69, (1987) · Zbl 0753.68088
[23] Wong, S.K.M.; Yao, Y.Y., Roughness theory, (), 877-883
[24] Wybraniec-Skardowska, U., On a generalization of approximation space, Bulletin of the Polish Academy of sciences: mathematics, 37, 51-61, (1989) · Zbl 0755.04011
[25] Yao, Y.Y., Two views of the theory of rough sets in finite universes, International journal of approximate reasoning, 15, 291-317, (1996) · Zbl 0935.03063
[26] Yao, Y.Y.; Lin, T.Y., Generalization of rough sets using modal logic, Intelligent automation and soft computing, an international journal, 2, 103-120, (1996)
[27] Zakowski, W., Approximations in the space (U, π), Demonstratio Mathematica, XVI, 761-769, (1983) · Zbl 0553.04002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.