A Note on 3-valued Rough Logic Accepting Decision Rules

• Autorzy: Polkowski L.
• Języki publikacji: EN

Abstrakty

EN

Rough sets carry, intuitively, a 3-valued logical structure related to the three regions into which any rough set x divides the universe., viz., the lower definable set i(x), the upper definable set c(x), and the boundary region c(x)\i(x) witnessing the vagueness of associated knowledge. In spite of this intuition, the currently known way of relating rough sets and 3-valued logics is only via 3-valued ukasiewicz algebras (Pagliani) that endow spaces of disjoint representations of rough sets with its structure. Here, we point to a 3-valued rough logic RL of unary predicates in which values of logical formulas are given as intensions over possible worlds that are definable sets in a model of rough set theory (RZF). This logic is closely related to the ukasiewicz 3-valued logic, i.e., its theorems are theorems of the ukasiewicz 3-valued logic and theorems of the ukasiewicz 3-valued logic are in one-to-one correspondence with acceptable formulas of rough logic. The formulas of rough logic have denotations and are evaluated in any universe U in which a structure of RZF has been established. RZF is introduced in this note as a variant of set theory in which elementship is defined via containment, i.e., it acquires a mereological character (for this, see the cited exposition of Lesniewski's ideas). As an application of rough logic RL, decision rules and dependencies in information systems are characterized as acceptable formulas of this logic whereas functional dependencies turn out to be theorems of rough logic RL.

Słowa kluczowe

EN

rough sets; definable sets; rough elementship; rough set theory; rough logic RL; decision rule; dependency rule

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 61, nr 1
• Strony: 37--45
• Opis fizyczny: Bibliogr. 17 poz.

Twórcy

autor

Polkowski L.

• Polish-Japanese Institute of Information Technology, Koszykowa 86, 02-008 Warsaw, Poland
• Department of Mathematics and Computer Science, Univ. Warmia and Mazury, Żołnierska 14, 10560 Olsztyn, Poland

Bibliografia

• [1] van Benthem, J.: A Manual of Intensional Logic, CSLlSteLnfordUnnersily, 1988.
• [2] Goldberg, H., Leblanc, H., and Weaver, G.: A strong completeness theorem for 3-valued logic, Notre Dame J. Formal Logic, 15, 1974, 325-332.
• [3] Leśniewski, S.: On the foundations of mathematics, Topoi,2, 1982,7-52.
• [4] Łukasiewicz, J.: On three-valued logic (in Polish),Ruch Filozoficzny, 5, 1920, 170-171. English translation in: Jan Łukasiewicz. Selected Works (Borkowski, L., Ed.), North Holland and Polish Scientific Publishers, Amsterdam and Warsaw, 1970.
• [5] Montague, R.: Formal Philosophy, (Thomason, R., Ed.), Yale University Press, New Haven, 1974.
• [6] Orłowska, E.: Logic for reasoning about knowledge, Z. Math. Logik Grund. Math., 35, 1989, 559-572.
• [7] Orłowska, E.: Modal logics in the theory of information systems, Z. Math. Logik Grund. Math., 35, 1989, 559-572.
• [8] Ortowska, E., Pawlak, Z.: Representation of non-deterministic information, Theor. Computer Sci., 29,1984, 27-39.
• [9] Pagliani, P.: Rough set theory and logic-algebraic structures, in: Incomplete Information: Rough Set Analysis (Ortowska, E., Ed.), Physica-Verlag, Heidelberg, 1998,109-192.
• [10] Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer, Dordrecht, 1991.
• [11] Pawlak, Z.: Rough sets. Int. J. Comp. Inform. Sci., 11, 1982, 341-356.
• [12] Polkowski, L.: Rough Sets. Mathematical Foundations, Physica Verlag, Heidelberg, 2002.
• [13] Rasiowa, H., Skowron, A.: Rough concepts logic, in: Computation Theory {Skowron, A., Ed.), Lecture Notes in Computer Science, 208, Springer-Verlag, Berlin, 1985, 288-297.
• [14] Rasiowa, H., Skowron, A.: Approximation logic, in: Proceedings of Mathematical Methods of Specification and Synthesis of Software Systems Conference, Akademie Verlag 31, Berlin, 1985, 123-139.
• [15] Rosser, J. B., Turquette, A. R.: Many-ValuedLogics,'NoTth Holland, Amsterdam, 1958.
• [16] Wajsberg, M.: Axiomatization of the three-valued sentential calculus (in Polish; German summ.), C. R. Soc. Sci. Lettr. Varsovie, 24, 1931, 126-148.
• [17] Vakarelov, D.: Information systems, similarity relations and modal logics, in: Incomplete Information: Rough Set Analysis (Ortowska, E., Ed.), Physica-Verlag, Heidelberg, 1998,492-550