Dependence Spaces of Information Systems

A general model is introduced and investigated of a great variety of finite structures studied in computer science. The model is referred to as dependence space. The main feature of the model is that it enables us to deal with the indiscernibility-type incompleteness of information that a modelled structure might be burdened with. The model provides a general framework for expressing the concept of independence of a set and the concept of dependency between sets with respect to a dependence space. It is shown that these concepts lay the foundation on which many applied structures rest. The theory of dependence spaces is developed aimed at providing tools for studying the problems relevant for the modelled structures.

[1]  Zdzislaw Pawlak,et al.  On a problem concerning dependence spaces , 1992, Fundam. Informaticae.

[2]  Zdzisław Pawlak,et al.  Concept forming and black boxes , 1987 .

[3]  Zdzisław Pawlak,et al.  On rough equalities , 1985 .

[4]  Jaromír Duda.  Boolean concept lattices and good contexts , 1989 .

[5]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[6]  Zdzisław Pawlak,et al.  Information storage and retrieval system - mathematical foundations. , 1974 .

[7]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[8]  Zdzisław Pawlak,et al.  Black box analysis and rough top equalities , 1985 .

[9]  Cecylia Rauszer.  Reducts in information systems , 1991, Fundam. Informaticae.

[10]  Jadzia Cendrowska,et al.  PRISM: An Algorithm for Inducing Modular Rules , 1987, Int. J. Man Mach. Stud..

[11]  Miroslav Novotný,et al.  On Dependence in Wille's Contexts , 1993, Fundam. Informaticae.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  M. Novotny.  On sequents defined by means of information systems , 1981, Fundam. Informaticae.

[14]  Robin Milner.  An Action Structure for Synchronous pi-Calculus , 1993, FCT.

[15]  Kazimierz Głazek.  Some old and new problems in the independence theory , 1979 .

[16]  Witold Lipski.  Two NP-Complete Problems Related to Information Retrieval , 1977, FCT.

[17]  Otakar Borůvka.  Grundlagen der Gruppoid- und Gruppentheorie , 1960 .

[18]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[19]  Z. Pawlak,et al.  Independence of attributes , 1988 .

[20]  Thomas C. Bartee,et al.  Modern Applied Algebra , 1999 .

[21]  Zdzisław Pawlak,et al.  On a representation of rough sets by means of information systems , 1983 .

[22]  B. Balkay,et al.  Introduction to lattice theory , 1965 .

[23]  Miroslav Novotný,et al.  Notes on the algebraic approach to dependence in information systems , 1992, Fundam. Informaticae.

[24]  Adam Mrózek,et al.  Rough Sets and Dependency Analysis among Attributes in Computer Implementations of Expert's Inference Models , 1989, Int. J. Man Mach. Stud..

[25]  Zdzislaw Pawlak,et al.  Algebraic theory of independence in information systems , 1991, Fundam. Informaticae.

[26]  Zdzisław Pawlak.  Rough sets. Algebraic and topological approach , 1982 .

[27]  Claudio L. Lucchesi,et al.  Candidate Keys for Relations , 1978, J. Comput. Syst. Sci..

[28]  Z. Pawlak,et al.  Partial dependency of attributes , 1988 .