• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

A Note on Definability in Rough Set Theory

Jouni Järvinen, Jari Kortelainen, A Note on Definability in Rough Set Theory. In: R. De Caluwe G. De Tré J. Fodor J. Kacprzyk S. Zadrożny B. De Baets (Ed.), Current Issues in Data and Knowledge Engineering, 272-277, Akademicka Oficyna Wydawnicza EXIT, 2004.

Abstract:

In this paper, the definability concept of Rough Set Theory is extended to cases where the indistinguishability relation is arbitrary. Some basic results of extended definability are presented. The paper shows that our extended definability coincides with the conventional concept of definability in the case of tolerance relations. For quasi-orders, the definable sets form an Alexandroff topology.

BibTeX entry:

@INPROCEEDINGS{inpJaKo04a,
  title = {A Note on Definability in Rough Set Theory},
  booktitle = {Current Issues in Data and Knowledge Engineering},
  author = {Järvinen, Jouni and Kortelainen, Jari},
  editor = {B. De Baets, R. De Caluwe G. De Tré J. Fodor J. Kacprzyk S. Zadrożny},
  publisher = {Akademicka Oficyna Wydawnicza EXIT},
  pages = {272-277},
  year = {2004},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication