Advertisement

The Discernibility Matrices and Functions in Information Systems

  • Andrzej Skowron
  • Cecylia Rauszer
Part of the Theory and Decision Library book series (TDLD, volume 11)

Abstract

We introduce two notions related to any information system, namely the discernibility matrix and discernibility function. We present some properties of these notions and as corollaries we obtain several algorithms for solving problems related among other things to the rough definability, reducts, core and dependencies generation.

Keywords

Boolean Function Decision Table Optimal Decision Rule Discernibility Matrix Polish Acad 
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. [Bus86]
    Buszkowski W. and Orlowska E. (1986): On the Logic of Database Dependencies, Bull. Polish Acad. Sci. Math. vol. 34, 345–354MathSciNetzbMATHGoogle Scholar
  2. [Cas89]
    Casti J. L. (1989): Alternate Realities - Mathematical Models of Nature and Man, John Wiley and SonsGoogle Scholar
  3. [Cod70]
    Codd, E.F. (1970): A Relational Model of Data for Large Shared Data Banks, Comm. ACM. vol. 13, 377–387zbMATHCrossRefGoogle Scholar
  4. [Che88]
    Chen K.H., Ras Z. and Skowron A. (1988): Attributes and Rough Properties in Information Systems, Internat.J.Approx.Reason. 2 (4), 365–376MathSciNetzbMATHCrossRefGoogle Scholar
  5. [GJ79]
    Garey M.R. and Johnson D.S., (1979): Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman and Company, San FranciscozbMATHGoogle Scholar
  6. [Grz86]
    Grzymala-Busse J., (1986): On the Reduction of Knowledge Representation Systems, Proc. of the 6-th International Workshop on Expert Systems and their Applications, Avignon, France, April 28–30, 463–478Google Scholar
  7. [G1a79]
    Glazek K. (1979): Some Old and New Problems in the Independence Theory, Colloquium Mathematicum vol. 17, 127–189MathSciNetGoogle Scholar
  8. [Ha86]
    Halpern J.Y. ed. (1986): Theoretical Aspects of Reasoning about Knowledge, Morgan KaufmannGoogle Scholar
  9. [Hur83]
    Hurley R. B. (1983): Decision Tables in Software Engineering, Van Nostrand Reinhold Company, New YorkGoogle Scholar
  10. [Kau68]
    Kautz W.H. (1968): Fault Testing and Diagnosis in Combinational Digital Circuits, IEEE Transactions on Computers, April, 352–366Google Scholar
  11. [Lip79]
    Lipski W. Jr. (1979): On Semantic Issues Connected with Incomplete Information Databases, ACM Transactions on Database Systems vol. 4, 269–296CrossRefGoogle Scholar
  12. [Lip8l]
    Lipski W. Jr. (1981): On Databases with Incomplete Information, Journal of the ACM. vol. 28, 41–70MathSciNetzbMATHCrossRefGoogle Scholar
  13. [Los79]
    Los J. (1979): Characteristic Sets of a System of Equivalence Relations, Colloquium Mathematicum XLII, 291–293Google Scholar
  14. [Mar 58]
    Marczewski E. (1958): A general Scheme of Independence in Mathematics, BAPS, 731–736Google Scholar
  15. [Mo83]
    Moshkov M.Iu., (1982): On the Conditional Tests (in Russian), Dokl. Akad. Nauk SSSR 265 (2), 550–552.Google Scholar
  16. [Mro87]
    Mrozek A. (1987): Rough Sets and Some Aspects of Expert Systems Realization, Proc. 7-th Internat. Workshop on Expert Systems and their Applications, Avignon, France, 597–611Google Scholar
  17. [Nov88a]
    Novotny M. and Pawlak Z. (1988): Independence of Attributes, Bull. Polish Acad. Sci. Math. vol. 36, 459–465MathSciNetzbMATHGoogle Scholar
  18. [Nov88b]
    Novotny M. and Pawlak Z. (1988): Partial Dependency of Attributes Bull. Polish Acad. Sci. Math.vol. 36, 453–458MathSciNetzbMATHGoogle Scholar
  19. [Nov89]
    Novotny M. and Pawlak Z. (1989): Algebraic Theory of Independence in Information Systems, Institute of Mathematics Czechoslovak Academy of Sciences Report 51Google Scholar
  20. [Or183]
    Orlowska E. (1983): Dependencies of Attributes in Pawlak’s Information Systems, Fundamenta Informaticae vol. 6, 247–256MathSciNetzbMATHGoogle Scholar
  21. [Or184a]
    Orlowska E. and Pawlak Z. (1984): Expressive Power of Knowledge Representation Systems, International Journal of Man-Machine Studies vol. 20, 485–500zbMATHCrossRefGoogle Scholar
  22. [Or184b]
    Orlowska E. and Pawlak Z. (1984): Representation of Nondeterministic Information, Theoretical Computer Science vol. 29, 27–39MathSciNetCrossRefGoogle Scholar
  23. [Pag87]
    Pagliani P. (1987): Polystructured Model Spaces as Algorithm Oriented Models for Approximation Spaces and Pawlak’s Information Systems, Facolta di Science dell Informazione, Internal Raport PAG /3Google Scholar
  24. [Paw81a]
    Pawlak Z. (1981): Information Systems - Theoretical Foundations, ( The book in Polish ), PWN WarsawGoogle Scholar
  25. [Paw81b]
    Pawlak Z. (1981): Information Systems–Theoretical Foundations, Information Systems vol. 6, 205–218zbMATHCrossRefGoogle Scholar
  26. [Paw82]
    Pawlak Z. (1982): Rough sets, International Journal of Information and Computer Science vol. 11, 344–356MathSciNetGoogle Scholar
  27. [Paw85]
    Pawlak Z. (1985): On Rough Dependency of Attributes in Information Systems, Bull. Polish Acad. Sci. Tech. vol. 33, 481–485MathSciNetzbMATHGoogle Scholar
  28. [Paw85a]
    Pawlak Z. and Rauszer C. M. (1985): Dependency of Attributes in Information Systems, Bull. Polish Acad. Sci. Math. vol. 33, 551–559MathSciNetzbMATHGoogle Scholar
  29. [Paw91]
    Pawlak Z. (1991): Rough Sets: Theoretical Aspects of Reasoning about Data, KluwerzbMATHCrossRefGoogle Scholar
  30. [Par90]
    Parikh R. ed. (1990): Theoretical Aspects of Reasoning about Knowledge, Morgan KaufmannGoogle Scholar
  31. [RaS86]
    Rasiowa H. and Skowron A., (1986): Approximation Logic, In: Mathematical Methods of Specification and Synthesis of Software Systems ‘85, Akademie-Verlag Berlin, Band 31, 123–139CrossRefGoogle Scholar
  32. [Rau84]
    Rauszer C. M. (1984): An Equivalence Between Indiscernibility Relations in Information Systems and a Fragment of Intuitionistic Logic, Lecture Notes in Computer Science vol. 208, Springer Verlag, 298–317Google Scholar
  33. [Rau85a]
    Rauszer C. M. (1985): An Equivalence between Theory of Functional Dependencies and Fragment of Intuitionistic Logic, Bull. Polish Acad. Sci. Math. vol. 33, 571–679MathSciNetzbMATHGoogle Scholar
  34. [Rau85b]
    Rauszer C. M. (1985): An Algebraic and Logical Approach to Indiscernibility Relations, ICS PAS Reports No 559Google Scholar
  35. [Rau87]
    Rauszer C. M. (1987): Algebraic and Logical Description of Functional and Multivalued Dependencies. Proc of the Sec. Int. Symp. on Methodologies for Intelligent Systems. October 17, Charlotte, North Holland 1987, 145–155Google Scholar
  36. [Rau88]
    Rauszer C. M. (1988): Algebraic Properties of Functional Dependencies, Bull. Polish Acad. Sci. Math. vol. 33, 561–569MathSciNetGoogle Scholar
  37. [Rau90]
    Rauszer C.: Decision Logic, to appear in Fundamenta InformaticaeGoogle Scholar
  38. [Sa168]
    Salton G. (1968): Automatic Information Organization and Retrieval, McGraw-Hill, New YorkGoogle Scholar
  39. [Sk88]
    Skowron A. (1988): On Topology in Information Systems, Bull. Acad. Polon. Sci. Math. vol. 36, pp. 477–479MathSciNetzbMATHGoogle Scholar
  40. [Sk90]
    Skowron A. (1990): An Approach to Synthesis of Decision Algorithms in Interaction with Knowledge Bases and Environment. An Example Based on Some Glaucoma Processes (in cooperation with Medical Center in Warsaw), manuscript pp.1–173, WarsawGoogle Scholar
  41. [Sko91]
    Skowron A. and Stepaniuk J. (1991): Towards an Approximation Theory of Discrete Problems: Part I, Fundamenta Informaticae 15 (2), 187–208MathSciNetzbMATHGoogle Scholar
  42. [Sk91]
    Skowron A. (1991): The Discernibility Matrix and Function in Information System, manuscriptGoogle Scholar
  43. [Tr82]
    Truszczynski M., (1982): Algorithmic Aspects of the Minimization of the Set of Attribute Problems, Fundamenta Informaticae 4 (4)Google Scholar
  44. [Vak87]
    Vakarelov D. (1987): Abstract Characterization of Some Modal Knowledge Representation Systems and the Logic NIL of Nondeterministic Information, In: Jorraud, Ph. and Squrev, V. (ed.) Artificial Intelligence I I, Methodology, Systems, Applications, North HollandGoogle Scholar
  45. [Vak89]
    Vakarelov D. (1989): Modal Logics for Knowledge Representation Systems,LNCS vol.363: 257–277MathSciNetGoogle Scholar
  46. [Weg87]
    Wegener I. (1987): The Complexity of Boolean Functions, John Wiley and SonsGoogle Scholar
  47. [Wil82]
    Wille R. (1982): Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts, In: I.Rival (Ed.), Ordered Sets, Reidel, Dordrecht-Boston, 445–470CrossRefGoogle Scholar
  48. [Zia87]
    Ziarko W. (1987): On Reduction of Knowledge Representation, Proc. 2-nd International Symp.on Methodologies of for Intelligent Systems, Charlotte USA, North Holland, 99–113Google Scholar
  49. [Zia88]
    Ziarko W. (1988): Acquisition of Design Knowledge from Examples, Math. Comput. Modeling vol. 10, 551–554CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1992

Authors and Affiliations

  • Andrzej Skowron
    • 1
  • Cecylia Rauszer
    • 1
  1. 1.Institute of MathematicsUniversity of WarsawWarsawPoland

Personalised recommendations