Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
First-order rough logic I: approximate reasoning via rough sets
Fundamenta Informaticae - Special issue: rough sets
Incomplete Information: Structure, Inference, Complexity
Incomplete Information: Structure, Inference, Complexity
Rough Set Semantics for Non-classical Logics
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
Galois Connections and Data Analysis
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Distance Measures Induced by Finite Approximation Spaces and Approximation Operators
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Information quanta and approximation operators: once more around the track
Transactions on rough sets VIII
A novel approach to attribute reduction in concept lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Rough set approximations in formal concept analysis
Transactions on Rough Sets V
Distance Measures Induced by Finite Approximation Spaces and Approximation Operators
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Rough set model based on formal concept analysis
Information Sciences: an International Journal
| Hi-index | 0.00 |
The paper examines Formal Concept Analysis (FCA) and Rough Set Theory (RST) against the background of the theory of finite approximations of continuous topological spaces. We define the operators of FCA and RST by means of the specialisation order on elements of a topological space X which induces a finite approximation of X. On this basis we prove that FCA and RST together provide a semantics for tense logic S4.t. Moreover, the paper demonstrates that a topological space X cannot be distinguished from its finite approximation by means of the basic temporal language. It means that from the perspective of topology S4.t is a better account of approximate reasoning then unimodal logics, which have been typically employed.