Skip to main content
Springer Nature Link
Log in

Relative Similarity Logics are Decidable: Reduction to FO2 with Equality

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1489))

Included in the following conference series:

  • 242 Accesses

Abstract

We show the decidability of the satisfiability problem for relative similarity logics that allow classification of objects in presence of incomplete information. As a side-effect, we obtain a finite model property for such similarity logics. The proof technique consists of reductions into the satisfiability problem for the decidable fragment FO2 with equality from classical logic. Although the reductions stem from the standard translation from modal logic into classical logic, our original approach (for instance handling nominals for atomic properties and decomposition in terms of components encoded in the reduction) can be generalized to a larger class of relative logics, opening ground for further investigations.

This work has been partially supported by the Polish-French Project “Rough-set based reasoning with incomplete information: some aspects of mechanization”, #7004.

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.

Similar content being viewed by others

References

  1. Ph. Balbiani. Axiomatization of logics based on Kripke models with relative accessibility relations. In [Oe97], pages 553–578, 1997.

    Google Scholar 

  2. J. van Benthem. Modal logic and classical logic. Bibliopolis, 1983.

    Google Scholar 

  3. J. van Benthem. The range of modal logic-An essay in memory of George Gargov. Journal of Applied Non-Classical Logics, 1998. To appear.

    Google Scholar 

  4. P. Blackburn. Nominal tense logic. Notre Dame Journal of Formal Logic, 34(1):56–83, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. Demri. A logic with relative knowledge operators. Journal of Logic, Language and Information, 1998. To appear.

    Google Scholar 

  6. S. Demri and E. Orłowska. Informational representability: Abstract models versus concrete models. In D. Dubois and H. Prade, editors, Linz Seminar on Fuzzy Sets, Logics and Artificial Intelligence, Linz, Austria. Kluwer Academic Publishers, February 1996. To appear.

    Google Scholar 

  7. L. Fariñas del Cerro and E. Orłowska. DAL-A logic for data analysis. In T. O’Shea, editor, ECAI-6, pages 285–294, September 1984.

    Google Scholar 

  8. G. Gargov and V. Goranko. Modal logic with names. Journal of Philosophical Logic, 22(6):607–636, December 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. E. Grädel, Ph. Kolaitis, and M. Vardi. On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic, 3(1):53–69, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  10. G. Gargov and S. Passy. A note on boolean modal logic. In P. Petkov, editor, Summer School and Conference on Mathematical Logic’ 88, pages 299–309. Plenum Press, 1990.

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. H. Lewis. Complexity results for classes of quanticational formulas. Journal of Computer and System Sciences, 21:317–353, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Mortimer. On language with two variables. Zeit. für Math. Logik and Grund. der Math., 21:135–140, 1975.

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. E. Orłowska and Z. Pawlak. Representation of nondeterministic information. Theoretical Computer Science, 29:27–39, 1984.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. L. Pacholski, W. Szwast, and L. Tendera. Complexity of two-variable logic with counting. In LICS, pages 318–327. IEEE, July 1997.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. D. Vakarelov. Logical analysis of positive and negative similarity relations in property systems. In M. de Glas and D. Gabbay, editors, First World Conference on the Fundamentals of Artificial Intelligence, 1991.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  25. M. Vardi. Why is modal logic so robustly decidable? In Descriptive complexity and finite models, A.M.S., 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LEIBNIZ - C.N.R.S., France

    Stéphane Demri & Beata Konikowska

  2. Institute of Computer Science, Polish Academy of Sciences, Warszawa, Poland

    Stéphane Demri & Beata Konikowska

Authors
  1. Stéphane Demri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Beata Konikowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, Maryland, 20742, USA

    Jürgen Dix

  2. I.R.I.T. Université Paul Sabatier, 118 route de Narbonne, F-31062, Toulouse Cedex, France

    Luís Fariñas del Cerro

  3. Fachbereich 4: Informatik, Universität Koblenz, Rheinau 1, D-56075, Koblenz, Germany

    Ulrich Furbach

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demri, S., Konikowska, B. (1998). Relative Similarity Logics are Decidable: Reduction to FO2 with Equality. In: Dix, J., del Cerro, L.F., Furbach, U. (eds) Logics in Artificial Intelligence. JELIA 1998. Lecture Notes in Computer Science(), vol 1489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49545-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-49545-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65141-3

  • Online ISBN: 978-3-540-49545-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics