Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
A Preview of the Basic Picture: A New Perspective on Formal Topology
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Temporal Dynamics in Information Tables
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Hi-index | 0.00 |
Approximation Spaces were introduced in order to analyse data on the basis of Indiscernibility Spaces, that is, spaces of the form , where U is a universe of items and E is an equivalence relation on U. Various authors suggested to consider spaces of the form , where R is any binary relation. This paper aims at introducing a further step consisting in taking into account spaces of the form , where {R_i}_{i∈I} is a family of binary relations, that we call „Dynamic Spaces” because by means of this generalisation we can account for different forms of dynamics. While Indiscernibility Spaces induce 0-dimensional topological spaces (Approximation Spaces), Dynamic Spaces induce various types of pre-topological spaces.