Axiomatization of Logics Based on Kripke Models with Relative Accessibility Relations

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


This paper presents a systematic study of the logics based on Kripke models with relative accessibility relations as well as a general method for proving their completeness. The Kripke models with relative accessibility relations come out in the context of the analysis of indiscernability in the information systems.


Modal Logic Binary Relation Atomic Formula Canonical Model Kripke Model 
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. [Bal]
    Bailhache, P.: Essai de logique déontique. Vrin, (1991)Google Scholar
  2. [Chi]
    Chellas, B.: Modal Logic: an Introduction. Cambridge University Press, (1980)Google Scholar
  3. [Del]
    Demri, S.: The validity problem for the logic DALLA is decidable. Bulletin of the Polish Academy of Sciences, 4, (1996), 79–86MathSciNetGoogle Scholar
  4. [DO1]
    Demri, S. and Orlowska, E.: Logical analysis of indiscernability. ICS Research Report 11/96, (1996), Warsaw University of Technology. See also chapter 11.Google Scholar
  5. [FHMV1]
    Fagin, R., Halpern, J., Moses, Y. and Vardi, M.: Reasoning About Knowledge. MIT Press, (1995)Google Scholar
  6. [FHV1]
    Fagin, R., Halpern, J. and Vardi, M.: What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM, 39, (1992), 328–376MathSciNetMATHCrossRefGoogle Scholar
  7. [FH1]
    Farinas del Cerro, L. and Herzig, A.: Modal deduction with applications in epistemic and temporal logics. D. Gabbay, C. Hogger and J. Robinson (editors), Handbook of Logic in Artificial Intelligence and Logic Programming, 4, Epistemic and Temporal Reasoning, Oxford University Press, (1995), 499–594Google Scholar
  8. [FO1]
    Farinas del Cerro, L. and Orlowska, E.: DAL - a logic for data analysis. Theoretical Computer Science, 36, (1985), 251–264MathSciNetMATHCrossRefGoogle Scholar
  9. [GP1]
    Gargov, G. and Passy, S.: A note on Boolean modal logic. P. Petkov (editor), Mathematical Logic. Plenum Press, (1990), 299–309Google Scholar
  10. [Gol]
    Goldblatt, R.: Logics of Time and Computation. Center for the Study of Language and Computation, Lecture Notes Number, 7, (1987)Google Scholar
  11. [Hal]
    Harel, D.: Dynamic logic. D. Gabbay and F. Guenthner (editors), Handbook of Philosophical Logic, 2, Extensions of Classical Logic. Reidel, (1984), 497–604Google Scholar
  12. [Hil]
    Hintikka, J.: Knowledge and Belief: an Introduction to the Logic of the two Notions. Cornell University Press, (1962)Google Scholar
  13. [HM1]
    van der Hoek, W. and Meyer, J.-J.: Making some issues of implicit knowledge explicit. Foundations of Computer Science, 3, (1992), 193–223MATHCrossRefGoogle Scholar
  14. [HCl]
    Hughes, G. and Cresswell, M.: A Companion to Modal Logic. Methuen, (1984)Google Scholar
  15. [Kol]
    Konikowska, B.: A formal language for reasoning about indiscernability. Bulletin of the Polish Academy of Sciences, 35, (1987), 239–249MathSciNetMATHGoogle Scholar
  16. [Ko2]
    Konikowska, B.: A logic for reasoning about relative similarity. E. Orlowska and H. Rasiowa (editors), Reasoning with Incomplete Information. Special issue of Studia Logica 58, (1997), 185–226MathSciNetMATHGoogle Scholar
  17. [OH11.
    Ohlbach, 11.-J. and Herzig, A.: Parameter structures for parametrized modal operators. J. Mylopoulos and R. Reiter (editors), IJCAI-91, Proceedings of the Twelfth International Conference on Artificial Intelligence, 1, Darling Harbour, Sydney, Australia, 24–30 August 1991, Morgan Kaufmann, (1991), 512–517Google Scholar
  18. [Orl]
    Orlowska, E.: Modal logics in the theory of information systems. Zeitschr. f. math. Logik und Grundlagen d. Math., 30, (1984), 213–222MathSciNetMATHGoogle Scholar
  19. [0r2]
    Orlowska, E.: Kripke models with relative accessibility relations and their applications to inferences with incomplete information. G. Mirkowska and H. Rasiowa (editors), Mathematical Problems in Computation Theory. Banach Center Publications, 21, Polish Scientific Publishers, (1988), 327–337Google Scholar
  20. [0r3]
    Orlowska, E.: Kripke semantics for knowledge representation logics. Studia Logica, 49, (1990), 255–272MathSciNetMATHCrossRefGoogle Scholar
  21. [Sal]
    Sahlqvist, H.: Completeness and correspondence in the first and second order semantics for modal logic. S. Kanger (editor), Proceedings of the Third Scandinavian Logic Symposium. North-Holland, (1975), 110–143Google Scholar
  22. [Val]
    Vakarelov, D.: Modal logics for knowledge representation systems. Theoret- ical Computer Science, 90, (1991), 433–456MathSciNetMATHGoogle Scholar
  23. [Va2]
    Vakarelov, D.: A modal theory of arrows. Arrow logics I. D. Pearce and G. Wagner (editors), Logics in AI, European Workshop JELIA ‘82, Berlin, Germany, September 1992, Proceedings. Lecture Notes in Artificial Intelligence 633, Springer-Verlag, (1992), 1–24Google Scholar
  24. [Wrl]
    von Wright, G.: Deontic logic. Mind, 60, (1951), 1–15Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Philippe Balbiani
    • 1
  1. 1.Laboratoire d’informatique de Paris-Nord, Institut GaliléeUniversité Paris-NordVilletaneuseFrance

Personalised recommendations