Rough Set Theory and Logic-Algebraic Structures

  • Piero Pagliani
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 13)

Abstract

Any Rough Set System induced by an Approximation Space can be given several logic-algebraic interpretations related to the intuitive reading of the notion of Rough Set. In this paper Rough Set Systems are investigated, first, within the framework of Nelson algebras and the structure of the resulting subclass is inherently described using the properties of Approximation Spaces. In particular, the logic-algebraic structure given to a Rough Set System, understood as a Nelson algebra is equipped with a weak negation and a strong negation and, since it is a finite distributive lattice, it can also be regarded as a Heyting algebra equipped with its own pseudo-complementation. The double weak negation and the double pseudo-complementation are shown to be projection operations connected to the notion of definability in Approximation Spaces. From this analysis we obtain an interpretation of Rough Sets Systems connected to three-valued Lukasiewicz algebras where the roles of projections operators are played by the two endomorphisms of these algebras. Finally, continuing to explore the point of view of Multi-Valued Logics suggested by the latter interpretation we achieve in a quite “natural” way an interpretation based on the notion of Chain Based Lattice. Here the projection operators are provided by the pseudo-supplementation and dual pseudo-supplementation.

Keywords

Boolean Algebra Approximation Space Heyting Algebra Elementary Class Stone Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BD1]
    Balbes, R., Dwinger, Ph.: Distributive Lattices. University of Missouri Press, (1974)Google Scholar
  2. [BD2]
    Balbes, R., and Dwinger, Ph.: Coproducts of Boolean algebras with applications to Post algebras. Colloq. Math., 24, 1, (1971), 15–25MathSciNetMATHGoogle Scholar
  3. [BFGR1]
    Boicescu, V., Filipoiu, A., Georgescu, G., and Rudeanu, S.: LukasiewiczMoisil Algebras. North-Holland, Amsterdam-New York-Oxford-Tokio, (1991)Google Scholar
  4. [CN1]
    Cattaneo, G., and Nisticó, G.: Brouwer-Zadeh posets and three-valued Lukasiewicz posets. Jour. of Fuzzy Sets and Systems, 25, (1988), 165–190Google Scholar
  5. [Cil]
    Cignoli, R.: Algebras de Moisil de orden n. Ph. D. Thesis, Univ. Nacional del Sur, Bahia Blanca, (1969)Google Scholar
  6. [Ci2]
    Cignoli, R.: Representation of Lukasiewicz and Post algebras by continuous functions. Colloq. Math., 24, 2, (1972), 127–138MathSciNetMATHGoogle Scholar
  7. [Ci3]
    Cignoli, R.: Coproducts in the category of Kleene and three-valued Lukasiewicz algebras. Studia Logica, 38, (1979), 237–245MathSciNetMATHCrossRefGoogle Scholar
  8. [Ci4]
    Cignoli, R.: The class of Kleene algebras satisfying an interpolation property and Nelson algebras. Algebra Universalis, 23, (1986), 262–292MathSciNetMATHCrossRefGoogle Scholar
  9. [Col]
    Comer, S.: On connections between information systems, rough sets and algebraic logic. In: Algebraic Methods in Logic and Computer Science. Banach Center Publ. 28, (1993)Google Scholar
  10. [CF1]
    Cornish, W.H., and Fowler, P.R.: Coproducts of Kleene algebras. Journ. Austral. Math. Soc., 27, (1979), 209–220MathSciNetCrossRefGoogle Scholar
  11. [DP1]
    Davey, B.A., and Priestly, H.A.: An Introduction to Lattices and Order. Oxford Univ. PressGoogle Scholar
  12. [DD1]
    Davey: B.A., and Duffus, D.: Exponentiation and duality. In [Rivi], 43–95Google Scholar
  13. [Dul]
    Dull Dunn, J.M.: The Algebra of Intensional Logics. Ph.D. Dissertation, University of Pittsburg, (1966)Google Scholar
  14. [Dwl]
    Dwinger, Ph.: Notes on Post algebras I and II. Indag. Math., 28, (1966), 462–478MathSciNetGoogle Scholar
  15. [EHl]
    Epstein, G., and Horn, A.: P-algebras, an abstraction from Post algebras. Algebra Universalis, 4, (1974), 195–206. Reprinted in [Rill, 108–120Google Scholar
  16. [EH2]
    Epstein, G., and Horn, A.: Chain based lattices. Journal of Mathematics, 55, 1, (1974), 65–84. Reprinted in [Ril], 58–76Google Scholar
  17. [ERl]
    Epstein, G., and Rasiowa, H.: Approximation reasoning and Scott’s information systems. Proc. 2nd Int. Symp. on Methodol. for Intelligent Systems, North-Holland, (1987)Google Scholar
  18. [GHKLMS1]
    Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., and Scott, D.: A Compendium of Continuous Lattices. Springer Verlag, (1980)Google Scholar
  19. [Gal]
    Gabbay, D.M.: LDS - labelled deductive systems. Dept. of Computing, Imperial College of Science, Technology zhaohuan Medicine, (1992)Google Scholar
  20. [Gil]
    Giuntini, R.: A Semantical Investigation on Brouwer-Zadeh logic. Jour. of Phil. Logic, 20, (1991), 411–433MathSciNetMATHGoogle Scholar
  21. [Iwl]
    Iwinski, T.B.: Algebraic approach to rough sets. Bull. Pol. Acad. of Sciences, Math., 35, 3–4, (1987), 673–683MathSciNetGoogle Scholar
  22. [Iw2]
    Iwinski, T.B.: Rough orders and rough concepts. Bull. Polish Acad. Of Sciences, Math., 37, 3–4, (1988), 187–192MathSciNetGoogle Scholar
  23. [J-Li]
    Johnson-Laird, P.N.: The Computer and the Mind. Harvard University Press, (1988)Google Scholar
  24. [Jol]
    Johnston, P.T.: Stone Spaces. Cambridge University Press, (1982)Google Scholar
  25. [Kul]
    Kubat, M.: Conceptual inductive learning: the case of unreliable teachers. Artificial Intell., 52, (1991), 168–182MathSciNetCrossRefGoogle Scholar
  26. [Kal]
    Kalman, J.: Lattices with involution. Trans. Amer. Math. Soc., 87, (1958), 485–491MathSciNetMATHCrossRefGoogle Scholar
  27. [LW1]
    Loksch, P., and Wille, R.: A mathematical model for Conceptual Knowledge Systems. Tech. Hochschule Darmstadt, Preprint Nr. 1325, (1988)Google Scholar
  28. [MP1]
    Marek, W., and Pawlak, Z.: Rough sets and information systems. Funda- menta Informaticae, VII, 1, (1984), 105–115MathSciNetGoogle Scholar
  29. [MMOUl]
    Miglioli, P.A., Moscato, U., Ornaghi, M. and Usberti, U.: A constructivism based on classical truth. Notre Dame Jour. of Formal Logic, 30, 1, (1990), 67–90MathSciNetCrossRefGoogle Scholar
  30. [Mol]
    Moisil, Gr.C.: Notes sur les logiques non-crysippiennes. Ann. Sc. Univ. Jassy, 26, (1949)Google Scholar
  31. [Mo2]
    Moisil, Gr.C.: Les logiques non-chrisyppiennes et leurs applications. Acta Phil. Fennica, 16, (1963), 137–152MathSciNetMATHGoogle Scholar
  32. [Mo3]
    Moisil, Gr.C.: Old and new Essays on Non-Classical Logics. (in Rumanian) Stintifica, Bucarest, (1965)Google Scholar
  33. [Monl]
    Monteiro, A.: Construction des algébres de Nelson finies. Bull. Pol. Acad. of Sciences, Math., 11, (1963), 359–362MathSciNetMATHGoogle Scholar
  34. [Mon2] Monteiro, A.: Algebras de Nelson semi-simples (abstract).
    Rev. Union Mat. Argentina, 21, (1963), 145–146Google Scholar
  35. [Mon3]
    Monteiro, A.: Construction des algébres de Lukasiewicz trivalentes dans les algébres de Boole monadiques, I. Math. Japonicae, 12, (1967), 1–23MathSciNetMATHGoogle Scholar
  36. [Mon4]
    Monteiro, A.: Sur les algébres de Heyting symmetriques. Portugaliae, Math., 39, (1980), 1–237MathSciNetGoogle Scholar
  37. [NP1]
    Novotnÿ, M., and Pawlak, Z.: On representation of rough sets by means of information systems. Fundamenta Informaticae, 6, (1983), 189–296Google Scholar
  38. [NP2]
    Novotnÿ, M., and Pawlak, Z.: Characterization of rough top equalities and rough bottom equalities. Bull. Polish Acad. of Sciences, Math., 33, 1–2, (1985), 91–97Google Scholar
  39. [NP3]
    Novotnÿ, M., and Pawlak, Z.: On rough equalities. Bull. Polish Acad. of Sciences, Math., 33, 1–2, (1985), 99–104Google Scholar
  40. [NP4]
    Novotnÿ, M., and Pawlak, Z.: Black box analysis and rough top equalities. Bull. Polish Acad. of Science., Math., 33, 1–2, (1985), 105–113Google Scholar
  41. [NP5]
    Novotnÿ, M., and Pawlak, Z.: Algebraic theory of independence in information systems. Fundamenta Informaticae, 14, (1991), 454–476MathSciNetMATHGoogle Scholar
  42. [Obl]
    Obtulowicz, A.: Rough sets and Heyting algebra valued sets. Bull. Pol. Acad. of Sciences, Math., 35, 9–10, (1987), 667–671MathSciNetGoogle Scholar
  43. [Orl]
    Orlowska, E.: Logic approach to information systems. Fundamenta Informaticae, VIII, 3–4, (1985), 359–378MathSciNetGoogle Scholar
  44. [Or2]
    Orlowska, E.: Semantics of knowledge operators. Bull. Pol. Acad. of Sciences, Math., 35, 5–6, (1987), 643–652MathSciNetGoogle Scholar
  45. [Or3]
    Orlowska, E.: Logic for reasoning about knowledge. Zeitschr. f. Math. Log. und Grund. d. Math., 35, (1989), 559–572MathSciNetMATHCrossRefGoogle Scholar
  46. [Or4]
    Orlowska, E.: Relational interpretation of modal logics. In: Andreka, H., Monk, J.D., and Nemeti, I. (eds.): Algebraic Logic, North-Holland, (1991)Google Scholar
  47. [OP1]
    Orlowska, E., and Pawlak, Z.: Representation of nondeterministic information. Theoretical Computer Science, 29, (1984), 27–39MathSciNetCrossRefGoogle Scholar
  48. [Pal]
    Pagliani, P.: Some remarks on special lattices and related constructive logics with strong negation. Notre Dame Jour. of Formal Logic, 31, 4, (1990), 515–528MathSciNetMATHCrossRefGoogle Scholar
  49. [Pa2]
    Pagliani, P.: A pure logic-algebraic analysis on rough top and rough bottom equalities. In: Ziarko W. (ed.) Proc. of Rough Sets and Knowledge Discovery’93, Banff, October 1993. Springer, 1994, 227–236Google Scholar
  50. [Pa3]
    Pagliani, P.: Towards a logic of rough set systems. In: Lin, T.Y., and Wildberg, A.M. (eds) Soft Computing, The Society for Comp. Simulation, (1995), 59–62Google Scholar
  51. [Pa4]
    Pagliani, P.: Rough sets and Nelson algebras Fundamenta Informaticae, 27, 2–3, (1996), 205–219MathSciNetGoogle Scholar
  52. [Pawl]
    Pawlak, Z.: Rough sets. ICS PAS Reports, 431, (1981)Google Scholar
  53. [Paw2]
    Pawlak, Z.: Rough sets. Algebraic and topological approach. Intern. Journ. of Inf. and Comp. Sciences, 11, (1982), 341–366MathSciNetMATHCrossRefGoogle Scholar
  54. [Paw3]
    Pawlak, Z.: Rough sets and fuzzy sets. Fuzzy Sets and Systems, 17, (1985), 99–102MathSciNetMATHCrossRefGoogle Scholar
  55. [Paw4]
    Pawlak, Z.: On learning - A rough set approach. In [Skl], 197–227Google Scholar
  56. [Paws]
    Pawlak, Z.: Rough Sets: A Theoretical Approach to Reasoning about Data. Kluwer, Dordrecht-Boston, (1991)MATHGoogle Scholar
  57. [PP1]
    Pomykala, J., and Pomykala, J.A.: The Stone algebra of rough sets. Bull. Polish Acad. of Sciences, Math., 36, 7–8, (1988), 495–508MathSciNetGoogle Scholar
  58. [Prl]
    Priestly, H.A.: Ordered sets and duality for distributive lattices. In: Pouzet, M., and Richard, D. (eds.) Orders: description and roles (Annales of Discrete Mathematics 23), North Holland, (1984), 39–60Google Scholar
  59. [RZ1]
    Ras, Z.W., and Zemankova, M.: Learning in knowledge based systems, a possibilistic approach. Proc. of 1986 CISS, Princeton, Math., 34, 3–4, (1986), 844–847Google Scholar
  60. [Ral]
    Rasiowa, H.: An Algebraic Approach to Non Classical Logics. NorthHolland, (1974)Google Scholar
  61. [Ra2]
    Rasiowa, H.: Logic approximating sequences of sets. Proc. Int. School and Sympos. on Math. Logic, Drushba, (1987), 167–186Google Scholar
  62. [RS1]
    Rasiowa, H., and Skowron, A.: Rough concept logic. In: [Skl], 288–297Google Scholar
  63. [Raul]
    Rauszer, C.M.: An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic. In: [Skl], 298–317Google Scholar
  64. [Ril]
    Rine, D.C.: Computer Science and Multiple-Valued Logic. Theory and Applications. North-Holland, (1991)Google Scholar
  65. [Rivi]
    Rival I.: (ed.), Ordered sets. NATO ASI Series 83, Reidel, (1982)Google Scholar
  66. [Sel]
    Sendlewski, A.: Some investigations of varieties of N-lattices. Studia Logica, XLIII, (1984), 258–280MathSciNetGoogle Scholar
  67. [Se2]
    Sendlewski, A.: Nelson algebras through Heyting ones: I. Studia Logica, 49, 1, (1990), 105–126MathSciNetMATHCrossRefGoogle Scholar
  68. [Skl]
    Skowron, A.: (ed.) Proc. 5th Symp. on Computation Theory. LNCS, 208, Springer-Verlag, (1984)Google Scholar
  69. [Trl]
    Traczyk, T.: Axioms and some properties of Post algebras. Colloq. Math., 10, (1963), 193–210MathSciNetMATHGoogle Scholar
  70. [Tr2] Traczyk, T.: Lattices with greatest (least)
    chain base. Bull. Pol. Acad. Sciences, Math., 23, (1975)Google Scholar
  71. [Tr3]
    Traczyk, T.: Post algebras through PO and Pi. lattices. In: [Ril], 121–142Google Scholar
  72. [Val]
    Vakarelov, D.: Notes on N-lattices and constructive logics with strong negation. Studia Logica, 36, (1977), 109–125MathSciNetMATHCrossRefGoogle Scholar
  73. [Wil]
    Wille, R.: Restructuring lattice theory. In: [Rivi], 445–470Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Piero Pagliani
    • 1
  1. 1.Research Group on Knowledge and Communication ModelsRomaItaly

Personalised recommendations