Approximation Spaces and Definability for Incomplete Information Systems
- 611 Downloads
Incomplete information systems are approached here by general methods of rough set theory (see Pawlak [6,7]). We define approximation spaces of incomplete information systems and study definability and strong definability of sets of objects.
Unable to display preview. Download preview PDF.
- 1.S. Blamey, Partial logic, in: D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, vol. 3, D. Reidel, Dordrecht, 1986, 1–70.Google Scholar
- 3.S. Demri and E. Orłowska, Logical Analysis of Indiscernibility, in: E. Orłowska (ed.), Incomplete Information: Rough Set Analysis, Physica-Verlag, Heidelberg, 1998, 347–380.Google Scholar
- 5.E. Orłowska and Z. Pawlak, Logical foundations of knowledge representation, ICS PAS Reports, 537, Warszawa, 1984.Google Scholar
- 7.Z. Pawlak, Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer, Dordrecht, 1991.Google Scholar