Skip to main content
SpringerLink
Log in

A class of information logics with a decidable validity problem

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1996 (MFCS 1996)

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

Abstract

For a class of prepositional information logics defined from Pawlak's information systems, the validity problem is proved to be decidable using a significant variant of the standard filtration technique. Actually the decidability is proved by showing that each logic has the strong finite model property and by bounding the size of the models. The logics in the scope of this paper are characterized by classes of Kripkestyle structures with interdependent equivalence relations and closed by the so-called restriction operation. They include Gargov's data analysis logic with local agreement and Nakamura's logic of graded modalities.

This work has been supported by the Centre National de la Recherche Scientifique (C.N.R.S.), France.

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

  1. Claudio Cerrato. Decidability by filtrations for graded normal logics (graded modalities V). Studia Logica, 53(1):61–73, 1994.

    Article  Google Scholar 

  2. Stéphane Demri. The validity problem for the logic DALLA is decidable, 1996. To appear in the Bulletin of the Polish Academy of Sciences.

    Google Scholar 

  3. Stéphane Demri and Ewa Orłowska. Logical analysis of indiscernibility, 1996. In: Orłowska, Ewa (ed.), Reasoning with Incomplete Information. To appear.

    Google Scholar 

  4. Luis Fariñas del Cerro and Ewa Orłowska. DAL — A logic for data analysis. Theoretical Computer Science, 36:251–264, 1985. Corrigendum in T.C.S., 47:345, 1986.

    Article  Google Scholar 

  5. Dov Gabbay. A general filtration method for modal logics. Journal of Philosophical Logic, 1:29–34, 1972.

    Article  Google Scholar 

  6. George Gargov. Two completeness theorems in the logic for data analysis. Technical Report 581, Institute of Computer Science, Polish Academy of Sciences, Warsaw, 1986.

    Google Scholar 

  7. G. Hughes and Max Cresswell. An introduction to modal logic. Methuen and Co., 1968.

    Google Scholar 

  8. Joseph Halpern and Yoram Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319–379, 1992.

    Article  Google Scholar 

  9. Beata Konikowska. A formal language for reasoning about indiscernibility. Bulletin of the Polish Academy of Sciences, 35:239–249, 1987.

    Google Scholar 

  10. Richard Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467–480, September 1977.

    Article  Google Scholar 

  11. David Makinson. On some completeness theorems in modal logic. The Journal of Symbolic Logic, 12:379–384, 1966.

    Google Scholar 

  12. Maarten Marx, Szabolos Mikulás, and Istvan Németi. Taming Logic. Journal of Logic, Language and Information, 4:207–226, 1995.

    Google Scholar 

  13. Akira Nakamura. On a logic based on fuzzy modalities. In 22nd International Symposium on Multiple-Valued Logic, Sendai, pages 460–466. IEEE Computer Society Press, May 1992.

    Google Scholar 

  14. Akira Nakamura. On a logic based on graded modalities. IEICE Transactions, E76-D(5):527–532, May 1993.

    Google Scholar 

  15. Ewa Orłowska. Logic of indiscernibility relations. In Andrzej Skowron, editor, Computation Theory, 5th Symposium, Zaborów, Poland, pages 177–186. LNCS 208, Springer-Verlag, 1984.

    Google Scholar 

  16. Ewa Orłowska. Logic approach to information systems. Fundamenta Informaticae, 8:361–379, 1985.

    Google Scholar 

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

    Article  Google Scholar 

  18. Zdzislaw Pawlak. Rough sets and fuzzy sets. Fuzzy sets and systems, 17:99–102, 1985.

    Google Scholar 

  19. Krister Segerberg. An essay in classical modal logic (three vols.). Technical Report Filosofiska Studier nr 13, Uppsala Universitet, 1971.

    Google Scholar 

  20. Dimiter Vakarelov. A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae, 15:61–79, 1991.

    Google Scholar 

  21. Dimiter Vakarelov. Modal logics for knowledge representation systems. Theoretical Computer Science, 90:433–456, 1991.

    Article  Google Scholar 

  22. Ming-Sheng Ying. On standard models of fuzzy modal logics. Fuzzy sets and systems, 26:357–363, 1988.

    Article  Google Scholar 

  23. Lofti Zadeh. Similarity relations and fuzzy orderings. Information Systems, 3:177–200, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LEIBNIZ Laboratory, IMAG Institute, 46, Avenue Félix Viallet, 38031, Grenoble Cedex, 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

Wojciech Penczek Andrzej Szałas

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demri, S. (1996). A class of information logics with a decidable validity problem. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_156

Download citation

  • DOI: https://doi.org/10.1007/3-540-61550-4_156

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61550-7

  • Online ISBN: 978-3-540-70597-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation