Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies

• Autorzy: Järvinen, J.
• Języki publikacji: EN

Abstrakty

EN

In this paper we show that each Galois connection between two complete lattices determines an Armstrong system, that is, a closed set of dependencies. Especially, we study Galois connections and Armstrong systems determined by Pawlak's information systems.

Słowa kluczowe

EN

Galois connection; Armstrong systems

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 75, nr 1-4
• Strony: 315-330
• Opis fizyczny: bibliogr. 15 poz.

Twórcy

autor

Järvinen, J.

• Turku Centre for Computer Science TUCS,University of Turku, 20014 Turku, Finland,

Bibliografia

• [1] Armstrong,W.W.: Dependency Structures of Data Base Relationships, Information Processing 74, Proceedings of IFIP Congress 74, Stockholm, Sweden, August 5-10, 1974, North-Holland, 1974.
• [2] Birkhoff, G.: Lattice Theory, vol. XXV of Colloquim publications, Third edition, American Mathematical Society (AMS), Providence, Rhode Island, 1995.
• [3] Codd, E.: A relational model of data for large shared data banks, Communications of the ACM, 13, 1970, 377-387.
• [4] Davey, B. A., Priestley, H. A.: Introduction to Lattices and Order, Second edition, Cambridge University Press, 2002.
• [5] Day, A.: The lattice theory of functional dependencies and normal decompositions, International Journal of Algebra and Computation, 2, 1992, 409-431.
• [6] Erné, M., Koslowski, J., Melton, A., Strecker, G. E.: A primer on Galois connections, in: Proceedings of the 1991 Summer Conference on General Topology and Applications in Honor of Mary Ellen Rudin and Her Work, vol. 704 of Annals of the New York Academy of Sciences, New York Academy of Sciences, 1993, 103-125.
• [7] Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations, Springer-Verlag, Berlin, 1999, Translated from the 1996 German original by Cornelia Franzke.
• [8] Garey, M. R., Johnson, D. S.: Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, CA, 1979.
• [9] Järvinen, J.: Preimage Relations and Their Matrices, in: Rough Sets and Current Trends in Computing, First International Conference, RSCTC'98, Warsaw, Poland, June 22-26, 1998, Proceedings (L. Polkowski, A. Skowron, Eds.), vol. 1424 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Heidelberg, 1998, 139-146.
• [10] Järvinen, J.: Armstrong systems on ordered sets, in: Combinatorics, Computability and Logic (C. S. Calude, M. J. Dinneen, S. Sburlan, Eds.), Springer Series in DiscreteMathematics and Theoretical Computer Science, Springer-Verlag, London, 2001, 137-149.
• [11] Novotný, M., Pawlak, Z.: Algebraic theory of independence in information systems., Fundamenta Informaticae, 14, 1991, 454-476.
• [12] Orłowska, E., Pawlak, Z.: Representation of nondeterministic information, Theoretical Computer Science, 29, 1984, 27-39.
• [13] Pawlak, Z.: Information systems theoretical foundations., Information Systems, 6, 1981, 205-218.
• [14] Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning About Data., Kluwer Academic Publishers Group, Dordrecht, 1991.
• [15] Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems, in: Intelligent Decision Support (R. Slowinski, Ed.), Kluwer Academic Publishers, Dordrecht, The Netherlands, 1992, 331-362.