Skip to main content

Axiomatization of Logics Based on Kripke Models with Relative Accessibility Relations

  • Chapter
Incomplete Information: Rough Set Analysis

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

Abstract

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bailhache, P.: Essai de logique déontique. Vrin, (1991)

    Google Scholar 

  2. Chellas, B.: Modal Logic: an Introduction. Cambridge University Press, (1980)

    Google Scholar 

  3. Demri, S.: The validity problem for the logic DALLA is decidable. Bulletin of the Polish Academy of Sciences, 4, (1996), 79–86

    MathSciNet  Google Scholar 

  4. 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. Fagin, R., Halpern, J., Moses, Y. and Vardi, M.: Reasoning About Knowledge. MIT Press, (1995)

    Google Scholar 

  6. 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–376

    Article  MathSciNet  MATH  Google Scholar 

  7. 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–594

    Google Scholar 

  8. Farinas del Cerro, L. and Orlowska, E.: DAL - a logic for data analysis. Theoretical Computer Science, 36, (1985), 251–264

    Article  MathSciNet  MATH  Google Scholar 

  9. Gargov, G. and Passy, S.: A note on Boolean modal logic. P. Petkov (editor), Mathematical Logic. Plenum Press, (1990), 299–309

    Google Scholar 

  10. Goldblatt, R.: Logics of Time and Computation. Center for the Study of Language and Computation, Lecture Notes Number, 7, (1987)

    Google Scholar 

  11. Harel, D.: Dynamic logic. D. Gabbay and F. Guenthner (editors), Handbook of Philosophical Logic, 2, Extensions of Classical Logic. Reidel, (1984), 497–604

    Google Scholar 

  12. Hintikka, J.: Knowledge and Belief: an Introduction to the Logic of the two Notions. Cornell University Press, (1962)

    Google Scholar 

  13. van der Hoek, W. and Meyer, J.-J.: Making some issues of implicit knowledge explicit. Foundations of Computer Science, 3, (1992), 193–223

    Article  MATH  Google Scholar 

  14. Hughes, G. and Cresswell, M.: A Companion to Modal Logic. Methuen, (1984)

    Google Scholar 

  15. Konikowska, B.: A formal language for reasoning about indiscernability. Bulletin of the Polish Academy of Sciences, 35, (1987), 239–249

    MathSciNet  MATH  Google Scholar 

  16. 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–226

    MathSciNet  MATH  Google Scholar 

  17. 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–517

    Google Scholar 

  18. Orlowska, E.: Modal logics in the theory of information systems. Zeitschr. f. math. Logik und Grundlagen d. Math., 30, (1984), 213–222

    MathSciNet  MATH  Google Scholar 

  19. 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–337

    Google Scholar 

  20. Orlowska, E.: Kripke semantics for knowledge representation logics. Studia Logica, 49, (1990), 255–272

    Article  MathSciNet  MATH  Google Scholar 

  21. 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–143

    Google Scholar 

  22. Vakarelov, D.: Modal logics for knowledge representation systems. Theoret- ical Computer Science, 90, (1991), 433–456

    MathSciNet  MATH  Google Scholar 

  23. 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–24

    Google Scholar 

  24. von Wright, G.: Deontic logic. Mind, 60, (1951), 1–15

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Balbiani, P. (1998). Axiomatization of Logics Based on Kripke Models with Relative Accessibility Relations. In: Orłowska, E. (eds) Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol 13. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1888-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1888-8_17

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-2457-5

  • Online ISBN: 978-3-7908-1888-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics