Skip to main content
SpringerLink
Log in

Knowledge Representation in Extended Pawlak’s Information Systems: Algebraic Aspects

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2284))

Abstract

The notion of an information system in Pawlak’s sense is extended by introducing a certain ordering on the attribute set, which allows to treat some attributes as parts of others. With every extended information system S associated is the set K(S) of those pieces of information that, in a sense, admit a direct access in S. The algebraic structure of the “information space” K(S) is investigated, and it is shown, in what extent the structure of S can be restored from the structure of its information space. In particular, an intrinsic binary relation on K(S), interpreted as entailment, is isolated, and an axiomatic description of a knowledge revision operation based on it is proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alchaurrón C.E., Gárdenfors P., Makinson D.: On the logic of theory change: Partial meet contraction and revision functions. J. Symb. Logic 50 (1985), 512–530.

    Google Scholar 

  2. Archangelsky, D.A., Taitslin, M.A.: A logic for information systems. Stud. Log. 58 (1997), 3–16.

    Article  MATH  MathSciNet  Google Scholar 

  3. Buneman P., Jung A., Ohori A.: Using powerdomains to generalize relational databases. Theor. Comput. Sci. 91 (1991), 23–55.

    Article  MATH  MathSciNet  Google Scholar 

  4. Cīrulis, J.: An algebraic approach to knowledge representation. MFCS’99, LNCS 1672 (1999), 299–309.

    Google Scholar 

  5. Cīrulis, J.: Are there essentially incomplete knowledge representation systems? FCT’01, LNCS 2138 (2001), 94–105.

    Google Scholar 

  6. Comer, S.D.: An algebraic approach to the approximation of information. Fund. Inform. 14 (1991), 492–502.

    MATH  MathSciNet  Google Scholar 

  7. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge UP, 1994.

    Google Scholar 

  8. Ganter, B, Wille, R.: Formale Begriffsanalyse. Mathematishe Grundlagen. Springer, 1996.

    Google Scholar 

  9. Gärdenfors P.: Belief revision: an introduction. In: Gärdenfors P. (ed.), Belief revision. Cambr. Univ. Press, 1992, 1–28.

    Google Scholar 

  10. Grätzer G.: Lattice Theory. Academie-Verlag, Berlin, 1978.

    Google Scholar 

  11. Düntsch, I., Gediga, G.: Algebraic aspects of attribute dependencies in information systems. Fund. Inform. 29 (1997), 119–133.

    MATH  MathSciNet  Google Scholar 

  12. Jaederman, M.: Information storage and retrieval systems IV. Systems with incomplete information. CC PAS Report 214, Warszaw, 1975.

    Google Scholar 

  13. Jung, A., Libkin, L., Puhlmann, H.: Decomposition of domains. MFPS’91, LNCS 598, 1992, 235–250.

    Google Scholar 

  14. Jung, A., Puhlmann, H.: Types, Logic, and Semantics for Nested Databases. Electr. Notes in Theoret. Comp. Sci. 1 (1995), URL: http://www.elsevier.nl/locate/entcs/volume1.html.

  15. Kryszkiewicz, M.: Rules in incomplete information systems. Inf. Sci. 113 (1999), 271–292.

    Article  MATH  MathSciNet  Google Scholar 

  16. Libkin, L.: A relational algebra for complex objects based on partial information. MFDBS’91, LNCS 495 (1991), 29–43.

    Google Scholar 

  17. Marek, W., Pawlak, Z.: Information storage and retrieval systems: Mathematical foundations. Theor. Comp. Sci. 1 (1976), 331–354.

    Article  MATH  MathSciNet  Google Scholar 

  18. Marek, W., Truszszyński, M.: Contributions to the theory of rough sets. Fund. Inform. 39 (1999), 389–409.

    MATH  MathSciNet  Google Scholar 

  19. Novotný, J., Novotný, M.: Notes on the algebraic approach to dependencies in information systems. Fund. Inform. 16 (1992), 263–273.

    MathSciNet  MATH  Google Scholar 

  20. Novotný, M., Pawlak, Z.: On a representation of rough sets by means of information systems. Fund. Inform. 6 (1983), 289–296.

    MATH  MathSciNet  Google Scholar 

  21. Novotný, M., Pawlak, Z.: Concept forming and black boxes. Bull. Polish Acad. Sci. Math. 35 (1987), 133–141.

    MATH  MathSciNet  Google Scholar 

  22. Novotný, M., Pawlak, Z.: Algebraic theory of independence in information systems. Fund. Inform. 14(1991), 454–476.

    MATH  MathSciNet  Google Scholar 

  23. Ohori, A.: Semantics of types for database objects. Theor. Comput. Sci. 76 (1990), 53–91.

    Article  MATH  MathSciNet  Google Scholar 

  24. Orlowska, E.: Logic approach to information systems. Fund. Inform. 8 (1985), 359–378.

    MATH  MathSciNet  Google Scholar 

  25. Orłovska, E., Pawlak, Z.: Representation of nondeterministic information. Theoret. Comput. Sci. 29 (1984), 27–39.

    Article  MathSciNet  Google Scholar 

  26. Pawlak, Z.: Information systems-theoretical foundations. Inform. Systems 6 (1981), 205–218.

    MATH  Google Scholar 

  27. Pawlak, Z., Rauszer, C.: Dependency of attributes in information systems. Bull. Polish. Acad. Sci. Math. 33 (1985), 561–569.

    MathSciNet  Google Scholar 

  28. Plotkin, T., Plotkin, B.: Geometrical aspect of databases and knowledge bases. Algebra Univers. 46 (2001), 131–161.

    Article  MATH  MathSciNet  Google Scholar 

  29. Plotkin, B., Plotkin, T.: Universal algebra and computer science. FCT’01, LNCS 2138 (2001), 35–44.

    Google Scholar 

  30. Polkowski, L., Skowron, A.: Rough mereology in information systems with applications to qualitative reasoning. Fund. Inform. 43 (2000), 291–320.

    MATH  MathSciNet  Google Scholar 

  31. Raś, Z.: Information retrieval systems, an algebraic approach, I, II. Fund Inform. 4 (1981), 551–603, 777-818.

    MathSciNet  MATH  Google Scholar 

  32. Salton, G.: Automathic Information Organization and Retrieval. McGill, N.Y., 1968.

    Google Scholar 

  33. Scott, D.S.: Domains for denotational semantics. Automata, Languages and Programs, LNCS 173, 1982, 577–613.

    Chapter  Google Scholar 

  34. Starke, P.H.: Abstrakte Automaten. WEB Deutscher Verl. Wissensch., Berlin, 1969.

    Google Scholar 

  35. Tsirulis, Ya..P.: Variations on the theme of quantum logic (in Russian). In: Algebra i Diskretnaya Matematika, Latv. State Univ., Riga, 1984, 146–158.

    Google Scholar 

  36. Vakarelov, D.: Consequence relations and information systems. In: R. Slowinski (ed.), Intelligent Decision Support. Handbook of Applications and Advances of Rough Sets Theory, Kluwer, 1992.

    Google Scholar 

  37. Vakarelov, D.: A duality between Pawlak’s knowledge representation systems and BI-Consequence Systems. Stud. Log. 55 (1995), 205–228.

    Article  MATH  MathSciNet  Google Scholar 

  38. Winskel, G.: An introduction to event structures. LNCS 354 1989, 364–397.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Latvia, Raiņa b., 19, LV-1586, Riga, Latvia

    Jānis Cīrulis

Authors
  1. Jānis Cīrulis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Systems (E814), Technical University of Vienna, Karlsplatz 13, 1040, Wien, Austria

    Thomas Eiter

  2. Department of Information Systems, Massey University, Private Bag 11 222, Palmerston North, New Zealand

    Klaus-Dieter Schewe

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cīrulis, J. (2002). Knowledge Representation in Extended Pawlak’s Information Systems: Algebraic Aspects. In: Eiter, T., Schewe, KD. (eds) Foundations of Information and Knowledge Systems. FoIKS 2002. Lecture Notes in Computer Science, vol 2284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45758-5_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45758-5_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43220-3

  • Online ISBN: 978-3-540-45758-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation