Topology via logic
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Rough sets through algebraic logic
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Information flow: the logic of distributed systems
Information flow: the logic of distributed systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A Pure Logic-Algebraic Analysis of Rough Top and Rough Bottom Equalities
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Calculi of Approximation Spaces
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Pre-topologies and dynamic spaces
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Transforming information systems
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Approximation spaces and information granulation
Transactions on Rough Sets III
Choice inclusive general rough semantics
Information Sciences: an International Journal
Dialectics of counting and the mathematics of vagueness
Transactions on Rough Sets XV
| Hi-index | 0.00 |
Rough Set Theory may be considered as a formal interpretation of observation of phenomena. On one side we have objects and on the other side we have properties. This is what we call a Property System. Observing is then the act of perceiving and then interpreting the binary relation (of satisfaction) between the two sides. Of course, the set of properties can be given a particular structure. However, from a pure "phenomenological" point of view, a structure is given by the satisfaction relation we observe. So it is a result and not a precondition. Phenomena, in general, do not give rise to topological systems but to pre-topological systems. In particular, "interior" and "closure" operators are not continuous with respect to joins, so that they can "miss" information. To obtain continuous operators we have to lift the abstraction level of Property Systems by synthesizing relations between objects and properties into systems of relations between objects and objects. Such relations are based on the notion of a minimal amount of information that is carried by an item. This way we can also account for Attribute Systems, that is, systems in which we have attributes instead of properties and items are evaluated by means of attribute values. But in order to apply our mathematical machinery to Attribute Systems we have to transform them into Property Systems in an appropriate manner.