Skip to main content
SpringerLink
Log in

Information algebras

  • Invited Lectures
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1995)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Cattaneo,G. and Nistico,G. (1989) Brouver-Zadeh posets and three-valued Lukasiewicz posets. Fuzzy Sets and Systems 33, 165–190.

    Google Scholar 

  • Cattaneo,G., Dalla Chiara,M.L. and Giuntini,R. (1993) Fuzzy-intuitionistic quantum logics. Studia Logica 52, 1–24.

    Google Scholar 

  • Comer,S. (1991) An algebraic approach to the approximation of information. Fundamenta Informaticae 14, 492–502.

    Google Scholar 

  • Duentsch, I. (1992) Rough relation algebras. Fundamenta Informaticae.

    Google Scholar 

  • Gargov,G., Passy,S. and Tinchev,T. (1987) Modal environment for Boolean speculations. In: Skordev,D. (ed) Mathematical Logic and Applications. Plenum Press, New York, 253–263.

    Google Scholar 

  • Goldblatt,R. (1991) Semantic analysis of orthologic. In: Goldblatt,R. Mathematics of Modality. CSLI Lecture Notes No. 43, Stanford, California, 81–97.

    Google Scholar 

  • Goranko,V. (1987) Completeness and incompleteness in the bimodal base L(R,-R). Proceedings of the Conference on Mathematical Logic Heyting'88, Chaika, Bulgaria. Plenum Press, New York.

    Google Scholar 

  • Goranko,V. (1990) Modal definability in enriched languages. Notre Dame Journal of Formal Logic 31, 81–105.

    Google Scholar 

  • Humberstone,I. (1983) Inaccessible worlds. Notre Dame Journal of Formal Logic 24, 346–352.

    Google Scholar 

  • Iwinski,T. (1987) Algebraic approach to rough sets. Bulletin of the PAS, Mathematics, vol 35, 673–683.

    Google Scholar 

  • Jonsson,B. and Tarski,A. (1951) Boolean algebras with operators. Part I. American Journal of Mathematics 73, 891–939.

    Google Scholar 

  • Jonsson,B. and Tarski,A. (1952) Boolean algebras with operators. Part II. American Journal of Mathematics 74, 127–162.

    Google Scholar 

  • Konikowska,B. (1987) A formal language for reasoning about indiscernibility. Bulletin of the PAS, Mathematics, vol 35, 239–249.

    Google Scholar 

  • Konikowska,B. (1994) A logic for reasoning about similarity. In: Orlowska,E. (ed) Reasoning with incomplete information. In preparation.

    Google Scholar 

  • Novotny,M. (1994) Dependence spaces of information systems. In: Orlowska,E. (ed) Modeling Incomplete Information. Fundamentals and Applications. In preparation.

    Google Scholar 

  • Orlowska,E. (1983) Semantics of vague concepts. In: Dorn,G. and Weingartner,P. (eds) Foundations of Logic and Linguistics. Problems and Solutions. Selected contributions to the 7th International Congress of Logic, Methodology, and Philosophy of Science, Salzburg 1983, London-New York, Plenum Press, 465–482.

    Google Scholar 

  • Orlowska,E. (1984) Logic of indiscernibility relations. Lecture Notes in Computer Science 208, Springer, Berlin-Heidelberg-New York, 177–186.

    Google Scholar 

  • Orlowska,E. (1985) Logic of nondeterministic information. Studia Logica XLIV, 93–102.

    Google Scholar 

  • Orlowska,E. (1987) Logic for reasoning about knowledge. Bulletin of the Section of Logic 16, No 1, 26–38. Also Zeitschrift fuer Mathematische Logik und Grundlagen der Mathematik 35, 1989, 559–572.

    Google Scholar 

  • Orlowska,E. (1988) Kripke models with relative accessibility and their application to inferences from incomplete information. In: Mirkowska,G. and Rasiowa,H. (eds) Mathematical Problems in Computation Theory. Banach Center Publications 21, 329–339.

    Google Scholar 

  • Orlowska,E. (1993) Rough set semantics for nonclassical logics. Proceedings of the Workshop on Rough Sets and Knowledge Discovery, Banff, Canada, 143–148.

    Google Scholar 

  • Pagliani,P. Rough sets theory and logic-algebraic structures. In: Orlowska,E. (ed) Modeling Incomplete Information. Fundamentals and Applications. In preparation.

    Google Scholar 

  • Pawlak,Z. (1991) Rough sets. Kluwer, Dordrecht.

    Google Scholar 

  • Pomykala,J.A. (1987) Approximation operations in approximation space. Bulletin of the PAS, Mathe-matics, vol 35, 653–662.

    Google Scholar 

  • Pomykala,J.A. (1988) On definability in the nondeterministic information system. Bulletin of the PAS, Mathematics, vol 36, 193–210.

    Google Scholar 

  • Pomykala,J.A. (1993) Approximation, similarity and rough constructions. ILLC Prepublication Series, University of Amsterdam, CT-93-07.

    Google Scholar 

  • Pomykala, J.A. and Pomykala,J.M. (1988) The Stone algebra of rough sets. Bulletin of the PAS, Mathematics vol 36, 495–508.

    Google Scholar 

  • Rauszer,C. and Skowron,A. (1992) The discernibility matrices and functions in information systems. In: Slowinski,R. (ed) Intelligent decision support. Handbook of applications and advances in the rough set theory. Kluwer, Dordrecht, 331–362.

    Google Scholar 

  • Vakarelov,D. (1987) Abstract characterization of some knowledge representation systems and the logic NIL of nondeterministic information. In: Ph.Jorrand and V.Sgurev (eds) Artificial Intelligence II, Methodology, Systems, Applications. North Holland, Amsterdam, 255–260.

    Google Scholar 

  • Vakarelov,D. (1989) Modal logics for knowledge representation. Lecture Notes in Computer Science 363, Springer, Berlin-Heidelberg-New York, 251–277.

    Google Scholar 

  • Vakarelov,D. (1991a) Logical analysis of positive and negative similarity relations in property systems. Proceedings of the First World Conference on the Fundamentals of Artificial Intelligence, Paris, France, 1991, 491–500.

    Google Scholar 

  • Vakarelov,D. (1991b) A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae 15, 61–79.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Theoretical and Applied Computer Science, Polish Academy of Sciences, Poland

    Ewa Orlowska

Authors
  1. Ewa Orlowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. S. Alagar Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orlowska, E. (1995). Information algebras. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-60043-4_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60043-5

  • Online ISBN: 978-3-540-49410-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation