Thesis supervisor: Tamás Mihálydeák
Location of studies (in Hungarian): Debreceni Egyetem Informatikai Kar Abbreviation of location of studies: DE IK
Description of the research topic:
Rough set theory goes back to Pawlak's original works. The main problem was the following: some objects cannot be distinguished in a given information system (a database) because same information can be embedded about them. These indiscernible objects have to be used in the same way, so they belong (do not belong) to a given set. What can we say if one of two indiscernible objects belongs and the other does not belong to a given set? If the indiscernible relation embedded in an information system is taken into consideration, then the lower and upper approximations of a given set appear, and one has to use them to make any decision about objects.
There are some important generalizations of classical rough set theory (different covering systems, general approximation spaces) and many application appeared in last three decades. From the logical point of view the following question is very important: What can we say about valid logical inferences if we rely on different approximations of sets (instead of the sets themselves)? Logical systems relying on different versions of rough set theory and their applications are in the focus of the subject.
Bibliography
James F. Peters, Andrzej Skowron: Transactions on Rough Sets (I.-XVII.) Lecture Notes in Computer Science, Springer, 2004-2014
Recommended language skills (in Hungarian): angol Number of students who can be accepted: 1
Deadline for application: 2018-11-15
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Login
