Information Systems, Similarity Relations and Modal Logics

  • Dimiter Vakarelov
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 13)


In the paper we study two types of information systems: ontological and logical. Systems of ontological type are Property systems and Attribute systems, where the information is represented in terms of the ontological concepts of object, property and attribute. Systems of logical type are Consequence systems and Bi-consequence systems where the information is represented by a collection of sentences, equipped with some inference mechanism. We prove that each Consequence system can be embedded into a certain Property system. The similar results hold for Bi-consequence systems and Attribute systems. These representation theorems are used to give an abstract characterization (by means of a finite set of first-order sentences) of some information relations in Property systems and Attribute systems, including various kinds of similarity relations. Several modal logics with modalities corresponding to some collections of information relations are introduced and their “query meaning” is discussed. One of the main results of the paper are the completeness theorems for the introduced modal logics with respect to their standard semantics.


Modal Logic Similarity Relation Modus Ponens Completeness Theorem Characterization Theorem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AT1]
    Archangelsky, D. and Taitslin, M.: A logic for data description. LNCS, 363, (1989), 2–12Google Scholar
  2. [Bel]
    Benthem, J.F.A.K.: Modal Logic and Classical Logic. Bibliopolis, Napoly, (1986)Google Scholar
  3. [Gabl]
    Gabbay, D.: Semantical Considerations in Heyting’s Intuitionistic Logic. Synthese Library, 148, D. Reidel Publishing Company, Holland, (1981)Google Scholar
  4. [Garl]
    Gargov, G.: Two completeness theorems in the logic for data analysis. ICS PAS Reports, 581, Warsaw, (1986)Google Scholar
  5. [HC1]
    Hughes, G. and Cresswell, M.J.: A Companion to Modal Logic. Methuen, London, (1984)Google Scholar
  6. [Orl]
    Orlowska, E.: Modal logics in the theory of information systems. Zeitschrift für Mathematishe Logik and Grundlagen Der Mathematik, 30, (1984), 213–222MathSciNetMATHCrossRefGoogle Scholar
  7. [Or2]
    Orlowska, E.: Logic of nondeterministic information. Studia Logica, XLIV, (1985), 93–102.Google Scholar
  8. [Or3]
    Orlowska, E.: Logic of indiscernibility relations. ICS PAS Reports, 546, (1984); LNCS, 208, 1985, 177–186MathSciNetGoogle Scholar
  9. [Or4]
    Orlowska, E.: Kripke models with relative accessibility relations and their applications to inferences from incomplete information. In: Mirkowska, G. and Rasiowa, H. (eds.) Mathematical Problems in Computation Theory. Banach Center Publications, 21, Polish Scientific Publishers, Warsaw, (1987), 327Google Scholar
  10. [Or5]
    Orlowska, E.: Logic approach to information systems. Fundamenta Informaticae, 8, (1988), 359–378MathSciNetGoogle Scholar
  11. [Or6]
    Orlowska, E.: Kripke semantics for knowledge representation logics. Studia Logica, XLIX, 2, (1990), 255–272MathSciNetGoogle Scholar
  12. [Or7]
    Orlowska, E.: Rough set semantics for nonclassical logics. Manuscript, (1993)Google Scholar
  13. [OP1]
    Orlowska, E. and Pawlak, Z.: Logical foundations of knowledge representation systems. ICS PAS Reports, 573, (1984)Google Scholar
  14. [OP2]
    Orlowska, E. and Pawlak, Z.: Representation of nondeterministic information. Theoretical Computer Science, 29, (1984), 27–39MathSciNetCrossRefGoogle Scholar
  15. [FCO1]
    Farinas, L., del Cerro and Orlowska, E.: DAL–a logic for data analysis. Theoretical Computer Science, 36, (1985), 251–264MathSciNetMATHCrossRefGoogle Scholar
  16. [Pal]
    Pawlak, Z.: Information systems–theoretical foundations. Information Systems, 6, (1981), 205–218MATHCrossRefGoogle Scholar
  17. [Pa2]
    Pawlak, Z.: Rough sets. International Journal of Information and Computer Science, 11, 5, (1982), 341–356MathSciNetMATHCrossRefGoogle Scholar
  18. Pa3] Pawlak, Z.: Systemy Informacyjne. WNT, Warszawa, (1983), In PolishGoogle Scholar
  19. [Pa4]
    Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht/Boston/London, (1991)MATHGoogle Scholar
  20. [Rai]
    Rasiowa, H.: Logic of approximating sequences of sets. Invited lecture, Proc. Advanced International School and Symposium of Mathematical Logic and Applications, Drushba, Bulgaria, (1986), 167–186Google Scholar
  21. RS1] Rasiowa, H. and Skowron, A.: Rough concepts logic. In: Computation Theory, 88,(ed.) Skowron, A., LNCS, 208, (1985), 288–297Google Scholar
  22. [RS2]
    Rasiowa, H. and Sikorski, R.: The Mathematics of Metamathematics. PWN, Warsaw, (1963)Google Scholar
  23. [Scl]
    Scott, D.: Domains for denotational Semantics. A corrected and expanded version of a paper prepared for ICALP’82, Aarhus, Denmark, (1982)Google Scholar
  24. [Sel]
    Segerberg, K.: Essay in Classical Modal Logic. Uppsala, (1971)Google Scholar
  25. [Se2]
    Segerberg, K.: Classical Propositional Operators. Clarendon Press, Oxford, (1982)MATHGoogle Scholar
  26. [S11]
    Slowinski, R. (ed.): Intelligent Decision Support, Handbook of Applications and Advances of Rough Sets Theory. Kluver Academic Publishers, (1992)Google Scholar
  27. [Stl]
    Stone, M.: Topological Representation of Distributive Lattices and Brouwerian Logics. Cas. Mat. Fys., 67, (1937), 1–25Google Scholar
  28. [Val]
    Vakarelov, D.: Abstract characterization of some knowledge representation systems and the logic NIL of nondeterministic information. In: Jorrand, Ph. and Sgurev, V. (ed.), Artificial Intelligence I I, Methodology, Systems, Applications. North-Holland, (1987)Google Scholar
  29. [Va2]
    Vakarelov, D.: S4 and S5 together — S4+5. In: 8th International Congress of Logic, Methodology and Philosophy of Science, LMPS’87, Moscow, USSR, 17–22 August 1987, Abstracts, 5, 3, (1987), 271–274Google Scholar
  30. [Va3]
    Vakarelov, D.: Modal characterization of the classes of finite and infinite quasi-ordered sets. SU/LAL/preprint, 1, (1988), Proc. Summer School and Conference on Mathematical Logic, Heyting’88, Chajka near Varna, Bulgaria, (1988)Google Scholar
  31. [Va4]
    Vakarelov, D.: Modal logics for knowledge representation systems. LNCS, 363, (1989), 257–277, Theoretical Computer Science, 90, (1991), 433–456MathSciNetMATHGoogle Scholar
  32. [Va5]
    Vakarelov, D.: A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae, XV, (1991), 61–79Google Scholar
  33. [Va6]
    Vakarelov, D.: Logical analysis of positive and negative similarity relations in property systems. In: WOCFAI’91, First World Conference on the Fundamentals of Artificial Intelligence, 1–5 July 1991, Paris, France, Proceedings (ed.) Michel De Glas and Dov Gabbay, (1991), 491–499Google Scholar
  34. [Va7]
    Vakarelov, D.: Rough polyadic modal logics. Journal of Applied Non-Classical Logics, 1, 1, (1991), 9–35MathSciNetMATHCrossRefGoogle Scholar
  35. [Va87]
    Vakarelov, D.: Consequence relations and information systems. In: [S11].Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Dimiter Vakarelov
    • 1
  1. 1.Department of Mathematical Logic with Laboratory for Applied Logic, Faculty of Mathematics and Computer ScienceSofia UniversitySofiaBulgaria

Personalised recommendations