Skip to main content
SpringerLink
Log in

Coping with Semilattices of Relations in Logics with Relative Accessibility Relations

  • Chapter
Relational Methods for Computer Science Applications

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

  • 156 Accesses

Abstract

We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms built upon the set of Boolean terms. The semantical structures of the logics contains a family of binary relations that can be viewed a homomorphism between semilattices. Various results related to decidability, axiomatization and computational complexity are established by faithfully translating the logics into more standard modal logics. The paper is a short survey of results obtained by translation for various logics of the above kind from the literature.

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. Archangelsky D. and Taitslin M. (1989) A logic for data description. In: Meyer A. and Taitslin M. (Ed.), Symposium on Logic Foundations of Computer Science, Pereslavl-Zalessky, 2–11. Springer-Verlag, Lecture Notes in Computer Science, Vol. 363, July

    Google Scholar 

  2. Balbiani Ph. (1996) A modal logic for data analysis. In: Penczek W. and Szalas A. (Ed.), 21st Symposium on Mathematical Foundations of Computer Sciences (MFCS’96), Krakow, 167–179. Lecture Notes in Computer Science, Vol. 1113, Springer-Verlag

    Google Scholar 

  3. Balbiani Ph. (1996) Modal logics with relative accessibility relations. In: Gabbay D. and Ohlbach H.J. (Ed.), Conference on Formal and Applied Practical Reasoning (FAPR’96), Bonn, 29–41. Springer-Verlag, June

    Chapter  Google Scholar 

  4. Balbiani Ph. (1997) Axiomatization of logics based on Kripke models with relative accessibility relations. In: [23], 553–578

    Google Scholar 

  5. Belnap N. (1982) Display logic. J. of Philosophical Logic, 11:375–417

    MathSciNet  MATH  Google Scholar 

  6. Balbiani Ph. and Orlowska E. (1999) A hierarchy of modal logics with relative accessibility relations. J. of Applied Non-Classical Logics, special issue in the Memory of George Gargov, 9:303–328

    Article  MathSciNet  MATH  Google Scholar 

  7. Demri S. (1998) A class of decidable information logics. Theoretical Computer Science, 195(1):33–60

    Article  MathSciNet  MATH  Google Scholar 

  8. Demri S. (1998) Coping with semilattices of relations in logics with relative accessibility relations (extended abstract). In: Orlowska E. and Szalas A. (Ed.), 4th International Seminar on Relational Methods in Logic, Algebra and Computer Science, 43–47, September

    Google Scholar 

  9. Demri S. (1999) A logic with relative knowledge operators. J. of Logic, Language and Information, 8(2):167–185

    Article  MathSciNet  MATH  Google Scholar 

  10. Demri S. and Gabbay D. (2000) On modal logics characterized by models with relative accessibility relations: Part I and Part II. Studia Logica, To appear

    Google Scholar 

  11. Demri S. and Goré R. (2000) Display calculi for logics with relative accessibility relations. J. of Logic, Language and Information, 9(2):213–236

    Article  MATH  Google Scholar 

  12. Demri S. and Konikowska B. (1998) Relative similarity logics are decidable: reduction to FO2 with equality. In: JELIA’98,279–293. Lecture Notes in Artificial Intelligence, Vol. 1489, Springer-Verlag

    Google Scholar 

  13. Demri S. and Orlowska E. (1999) Every finitely reducible logic has the finite model property with respect to the class of -formulae. Studia Logica, 62(2):177–200. Special issue edited by M.L. Dalla Chiara and D. Mundici. Selected papers in honour of Ettore Casari

    Article  MathSciNet  MATH  Google Scholar 

  14. Düntsch I. (1997) Rough sets and algebras of relations. In: [23], 95–108

    Google Scholar 

  15. Farirñas del Cerro L. and Orlowska E. (1985) DAL — A logic for data analysis. Theoretical Computer Science, 36:251–264

    Article  MathSciNet  Google Scholar 

  16. Goranko V. and Passy S. (1992) Using the universal modality: gains and questions. J. of Logic and Computation, 2(1):5–30

    Article  MathSciNet  MATH  Google Scholar 

  17. Harel D. (1984) Dynamic logic. In: Gabbay D. and Guenthner F. (Eds.), Handbook of Philosophical Logic, Volume II, 497–604. Reidel, Dordrecht

    Chapter  Google Scholar 

  18. Hemaspaandra E. (1996) The price of universality. Notre Dame Journal of Formal Logic, 37(2):173–203

    MathSciNet  Google Scholar 

  19. Järvinen J. (1997) Representation of information systems and dependences spaces, and some basic algorithms. Licentiate’s thesis

    Google Scholar 

  20. Konikowska B. (1997) A logic for reasoning about relative similarity. Studia Logica, 58(1):185–226

    Article  MathSciNet  MATH  Google Scholar 

  21. Mints G. (1988) Gentzen-type and resolution rules part I: propositional logic. In: Martin-Lóf P. and Mints G. (Eds.), International Conference on Computer Logic, Tallinn, 198–231. Springer Verlag, Lecture Notes in Computer Science, Vol. 417

    Google Scholar 

  22. Novotny M. (1997) Applications of dependence spaces. In: [23], 247–289

    Google Scholar 

  23. Orlowska E. (ed.) (1997) Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing. Physica-Verlag, Heidelberg

    Google Scholar 

  24. Orlowska E. (1984) Logic of indiscernibility relations. In: Skowron A. (Ed.), 5th Symposium on Computation Theory, Zaborów, Poland, 177–186. Lecture Notes in Computer Science, Vol. 208, Springer-Verlag

    Google Scholar 

  25. Orlowska E. (1984) Modal logics in the theory of information systems. Zeitschrift für Mathematik Logik und Grundlagen der Mathematik, 30(1):213–222

    Article  MathSciNet  MATH  Google Scholar 

  26. Orlowska E. (1988) Kripke models with relative accessibility and their applications to inferences from incomplete information. In: Mirkowska G. and Rasiowa H., (Ed.), Mathematical Problems in Computation Theory, 329–339. Banach Center Publications, Volume 21 PWN — Polish Scientific Publishers, Warsaw

    Google Scholar 

  27. Orlowska E. (1989) Logic for reasoning about knowledge. Zeitschrift für Mathematik Logik und Grundlagen der Mathematik, 35:559–568

    Article  MathSciNet  MATH  Google Scholar 

  28. Orlowska E. (1993) Reasoning with incomplete information: rough set based information logics. In: Alagar V., Bergler S. and Dong F. (Eds.), Incompleteness and Uncertainty in Information Systems Workshop, 16–33. Springer-Verlag, October

    Google Scholar 

  29. Papadimitriou Ch. (1994) Computational Complexity. Addison-Wesley Publishing Company

    MATH  Google Scholar 

  30. Pawlak Z. (1981) Information systems theoretical foundations. Information Systems, 6(3):205–218

    Article  MathSciNet  MATH  Google Scholar 

  31. Passy S. and Tinchev T. (1991) An essay in combinatory dynamic logic. Information and Computation, 93:263–332

    Article  MathSciNet  MATH  Google Scholar 

  32. Tarski A. (1953) Undecidable Theories. Studies in Logic and the foundations of Mathematics. North-Holland Publishing Company. In collaboration with A. Mostowski. and R. Robinson

    Google Scholar 

  33. Tarski A. (1953) Undecidable Theories. Studies in Logic and the foundations of Mathematics. North-Holland Publishing Company. In collaboration with A. Mostowski. and R. Robinson

    Google Scholar 

  34. Vakarelov D. (1992) A modal logic for cyclic repeating. Information and Cornputation, 101:103–122

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LEIBNIZ, C.N.R.S., 46 Avenue Félix Viallet, 38031, Grenoble, France

    Stéphane Demri

Authors
  1. Stéphane Demri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Telecommunications, ul. Szachowa 1, 04-894, Warsaw, Poland

    Ewa Orłowska

  2. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Demri, S. (2001). Coping with Semilattices of Relations in Logics with Relative Accessibility Relations. In: Orłowska, E., Szałas, A. (eds) Relational Methods for Computer Science Applications. Studies in Fuzziness and Soft Computing, vol 65. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1828-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1828-4_10

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-662-00362-6

  • Online ISBN: 978-3-7908-1828-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation