Skip to main content
SpringerLink
Log in

Deciding Regular Grammar Logics with Converse Through First-Order Logic

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide regular grammar logics with converse. The class of regular grammar logics includes numerous logics from various application domains. A consequence of the translation is that the general satisfiability problem for every regular grammar logics with converse is in EXPTIME. This extends a previous result of the first author for grammar logics without converse. Other logics that can be translated into GF2 include nominal tense logics and intuitionistic logic. In our view, the results in this paper show that the natural first-order fragment corresponding to regular grammar logics is simply GF2 without extra machinery such as fixed-point operators.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abadi, M., Burrows, M., Lampson, B., and Plotkin, G., 1993, “A calculus for access control in distributed systems,” ACM Transactions on Prog. Languages and Systems 15(4), 706–734.

    Article  Google Scholar 

  • Alechina, N. and Shkatov, D., 2003, “On decidability of intuitionistic modal logics,” in Third Workshop on Methods for Modalities, Nancy.

  • Andreka, H., Nemeti, I., and van Benthem, J., 1998, “Modal languages and bounded fragments of predicate logic,” Journal of Philosophical Logic 27(3), 217–274.

    Article  Google Scholar 

  • Areces, C., Blackburn, P., and Marx, M., 2000, “Complexity of hybrid temporal logics,” Logic Journal of the IGPL 8(5), 653–679.

    Article  Google Scholar 

  • Balbiani, P. and Herzig, A., 1994, “A translation from the modal logic of provability into K4,” Journal of Applied Non-Classical Logics 4, 73–77.

    Google Scholar 

  • Baldoni, M., 1998, Normal Multimodal Logics: Automated Deduction and Logic Programming. PhD thesis, Università degli Studi di Torino.

  • Baldoni, M., Giordano, L., and Martelli, A., 1998, “A tableau calculus for multimodal logics and some (un)decidability results,” in TABLEAUX-8, volume 1397 of Lecture Notes in Artificial Intelligence, H. de Swart, ed, pp. 44–59. Springer.

  • Blackburn, P. and Marx, M., 2002, “Remarks in Gregory’s ‘actually’ operator,” Journal of Philosophical Logic 31(1), 281–288.

    Article  Google Scholar 

  • Caucal, D., 1996, “On infinite transition graphs having a decidable monadic theory,” in ICALP’96, volume 1099 of Lecture Notes in Computer Science, pp. 194–205. Springer, Berlin.

  • Caucal, D., 2003, “On infinite transition graphs having a decidable monadic theory,” Theoretical Computer Science 290, 79–115.

    Article  Google Scholar 

  • Chagrov, A. and Shehtman, V., 1994, “Algorithmic aspects of propositional tense logics,” in CSL-8, Kazimierz, Poland, volume 933 of Lecture Notes in Computer Science, L. Pacholski and J. Tiuryn eds., pp. 442–455. Springer, Berlin.

  • Chagrov, A. and Zakharyaschev, M., 1997, Modal Logic. Clarendon Press, Oxford.

    Google Scholar 

  • Courcelle, B., 1994, “Monadic second-order definable graph transductions: A survey,” Theoretical Computer Science 126, 53–75.

    Article  MathSciNet  Google Scholar 

  • Fariñas del Cerro, L. and Gasquet, O., 2002, “A general framework for pattern-driven modal tableaux,” Logic Journal of the IGPL 10(1), 51–83.

    Article  Google Scholar 

  • Fariñas del Cerro, L. and Gasquet, O., 2004, “Modal tableaux for reasoning about diagrams,” to appear.

  • Fariñas del Cerro, L. and Penttonen, M., 1988, “Grammar logics,” Logique et Analyse 121/122, 123–134.

    Google Scholar 

  • D’Agostino, G., Montanari, A., and Policriti, A., 1995, “A set-theoretical translation method for polymodal logics,” Journal of Automated Reasoning 15, 317–337.

    Article  Google Scholar 

  • Demri, S., 2000, “The nondeterministic information logic NIL is PSPACE-complete,” Fundamenta Informaticae 42, 211–234.

    Google Scholar 

  • Demri, S., 2001, “The complexity of regularity in grammar logics and related modal logics,” Journal of Logic and Computation 11(6), 933–960.

    Article  Google Scholar 

  • Demri, S., 2002, “Modal logics with weak forms of recursion: PSPACE specimens,” in Advances in Modal Logics, selected papers from 3rd Workshop on Advances in Modal Logics (AIML’2000), M. de Rijke, H. Wansing, F. Wolter, and M. Zakharyaschev, eds., Leipzig, Germany, Oct. 2000, pp. 113–138. World Scientific.

  • Demri, S. and Goré, R., 2002, “Theoremhood preserving maps characterising cut elimination for modal provability logics.” Journal of Logic and Computation 12(5), 861–884.

    Article  Google Scholar 

  • Demri, S. and de Nivelle, H., February 2004, “Deciding regular grammar logics with converse through first-order logic,” arXiv:cs.LO/0306117.

  • de Nivelle, H., 1998, “A resolution decision procedure for the guarded fragment,” in CADE-15, Lindau, Germany, vol. 1421 of Lecture Notes in Artificial Intelligence, C. Kirchner and H. Kirchner, eds., pp. 191–204. Springer.

  • de Nivelle, H., 1999, “Translation of S4 and K5 into GF and 2VAR,” Manuscript, available from http://www.mpi-sb.mpg.de/~nivelle.

  • de Nivelle, H., April 2001, “Translation of S4 and K5 into GF and 2VAR,” Slides available from http://www.mpi-sb.mpg.de/~nivelle/ on WWW.

  • de Nivelle, H. and de Rijke, M., 2003, “Deciding the guarded fragments with resolution,” Journal of Symbolic Computation 35(1), 21–58.

    Article  Google Scholar 

  • de Nivelle, H. and Pratt-Hartmann, I., 2001, “A resolution-based decision procedure for the two-variable fragment with equality,” in IJCAR’01, vol. 2083 of Lecture Notes in Computer Science, R. Goré, A. Leitsch, and T. Nipkow, eds., pp. 211–225. Springer.

  • de Nivelle, H., Schmidt, R., and Hustadt, U., 2000. “Resolution-based methods for modal logics,” Logic Journal of the IGPL 8(3), 265–292.

    Article  Google Scholar 

  • Fagin, R., Halpern, J., Moses, Y., and Vardi, M., 1995, Reasoning About Knowledge. The MIT Press.

  • Fine, K., 1975, “Some connections between elementary and modal logic,” in 3rd Scandinavian Logic Symposium, S. Kanger, ed., pp. 15–31. North Holland.

  • Gabbay, D., 1975, “Decidability results in non-classical logics,” Annals of Mathematical Logic 8, 237–295.

    Article  Google Scholar 

  • Gabbay, D., 1981, “Expressive functional completeness in tense logic,” in Aspects of Philosophical Logic, U. Mönnich ed. pp. 91–117. Reidel.

  • Ganzinger, H. and de Nivelle, H., 1999, “A superposition decision procedure for the guarded fragment with equality,” in LICS’99, pp. 295–305.

  • Ganzinger, H., Meyer, C., and Veanes, M., 1999, “The two-variable guarded fragment with transitive relations (extended abstract),” in LICS’99, pp. 24–34. IEEE Computer Society Press.

  • Goré, R., 1999, “Tableaux methods for modal and temporal logics,” in Handbook of Tableaux Methods, M. d’Agostino, D. Gabbay, R. Hähnle, and J. Posegga, eds., pp. 297–396. Kluwer.

  • Goranko, V. and Passy, S., 1992, “Using the universal modality: Gains and questions,” Journal of Logic and Computation 2(1), 5–30.

    Google Scholar 

  • Grädel, E., 1999a, “Decision procedures for guarded logics,” in CADE’99, vol. 1632 of Lecture Notes in Artificial Intelligence, H. Ganzinger, ed., pp. 31–51. Springer.

  • Grädel, E., 1999b, “On the restraining power of guards,” The Journal of Symbolic Logic 64(4), 1719–1742.

    Google Scholar 

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

    Google Scholar 

  • Gregory, D., 2001, “Completeness and decidability results for some propositional modal logics containing ‘actually’ operators,” Journal of Philosophical Logic 30(1), 57–78.

    Article  Google Scholar 

  • Grädel, E. and Walukiewicz, I., 1999, “Guarded fixed point logic,” in LICS’99, pp. 45–54.

  • Herzig, A., 1989, Raisonnement automatique en logique modale et algorithmes d’unification. PhD thesis, Université Paul Sabatier, Toulouse.

    Google Scholar 

  • Heuerding, A., Seyfried, M., and Zimmermann, H., 1996, “Efficient loop-check for backward proof search in some non-classical propositional logic,” in Theorem Proving with Analytic Tableaux and Related Methods, 5th International Workshop (TABLEAUX’96), volume 1071 of Lecture Notes in Computer Science, P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, eds., pp. 210–225. Springer, Berlin.

  • Hirsch, C. and Tobies, S., 2002, “A tableau algorithm for the clique guarded fragment,” in Advances in Modal Logics, selected papers from 3rd Workshop on Advances in Modal Logics (AIML’2000), Leipzig, Germany, Oct. 2000, M. de Rijke, H. Wansing, F. Wolter, and M. Zakharyaschev, eds., pp. 257–278. World Scientific.

  • Hladik, J., 2002, “Implementation and optimisation of a tableau algorithm for the guarded fragment,” in Automated Reasoning with Analytic Tableaux and Related Methods, vol. 2381 of Lecture Notes in Computer Science, U. Egly and C. Fermüller, eds., pp. 145–159. Springer Verlag.

  • Hopcroft, J. and Ullman, J., 1979, Introduction to automata theory, languages, and computation. Addison-Wesley.

  • Horrocks, I. and Sattler, U., 1999, “A description logic with transitive and inverse roles and role hierarchies,” Journal of Logic and Computation 9(3), 385–410.

    Article  Google Scholar 

  • Horrocks, I. and Sattler, U., 2004, “Decidability of SHIQ with complex role inclusion axioms,” Artificial Intelligence 160(1/2), 79–104.

    Article  Google Scholar 

  • Hustadt, U. and Schmidt, R., 2003, “A principle for incorporating axioms into the first-order translation of modal formulae,” in CADE’03, vol. 2741 of Lecture Notes in Artificial Intelligence, pp. 412–426. Springer, Berlin. Long version in Schmidt & Hustadt 2004.

  • Kieronski, E., 2003, “The two-variable guarded fragment with transitive guards is 2EXPTIME-hard,” in 6th Int. Conf. on Foundations of Software Science and Computational Structures (FOSSACS’03), Warsaw, Poland, vol. 2620 of Lecture Notes in Computer Science, A. Gordon, ed., pp. 299–312. Springer, Berlin.

  • Ladner, R., 1977, “The computational complexity of provability in systems of modal propositional logic,” SIAM Journal of Computing 6(3), 467–480.

    Article  Google Scholar 

  • Massacci, F., 1997, “Tableaux methods for access control in distributed systems,” in TABLEAUX’97, vol. 1227 of Lecture Notes in Artificial Intelligence, D. Galmiche, ed., pp. 246–260. Springer, Berlin.

  • Massacci, F., 2000, “Single steps tableaux for modal logics,” Journal of Automated Reasoning 24(3), 319–364.

    Article  Google Scholar 

  • Marx, M., Mikulas, S., and Schlobach, S., 1999, “Tableau calculus for local cubic modal logic and its implementation,” Logic Journal of the IGPL 7(6), 755–778.

    Article  Google Scholar 

  • Mateescu, A. and Salomaa, A., 1997, “Formal languages: An introduction and a synopsis,” in Handbook of Formal Languages – Volume 1: Word, Language and Grammar, G. Rozenberg and A. Salomaa, eds., pp. 1–40. Springer.

  • Moore, R., 1977, “Reasoning about knowledge and action,” in IJCAI-5, pp. 223–227.

  • Morgan, C., 1976, “Methods for automated theorem proving in non classical logics,” IEEE Transactions on Computers 25(8), 852–862.

    Google Scholar 

  • Nonnengart, A., 1996, “Resolution-based calculi for modal and temporal logics,” in 13th Conference on Automated Deduction, vol. 1104 of Lecture Notes in Artificial Intelligence, M. McRobbie and J. Slaney, eds., pp. 599–612. Springer, Berlin.

  • Ohlbach, H.J., 1993, “Translation methods for non-classical logics: An overview,” Bulletin of the Interest Group in Propositional and Predicate Logics 1(1), 69–90.

    Google Scholar 

  • Ohlbach, H.J., Nonnengart, A., de Rijke, M., and Gabbay, D., 2001, “Encoding two-valued non-classical logics in classical logic,” in Handbook of Automated Reasoning, A. Robinson and A. Voronkov, eds., pp. 1403–1486. Elsevier Science Publishers B.V.

  • Orłowska, E., 1988, “Relational interpretation of modal logics,” in Algebraic logic. Colloquia Mathematica Societatis Janos Bolyai 54, H. Andréka, D. Monk, and I. Németi, eds., pp. 443–471, Amsterdam, 1988. North Holland.

  • Perrin, D., 1990, “Finite automata,” in Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, J. Van Leeuwen, ed., pp. 1–57. Elsevier.

  • Pin, J.E., 1994, “Logic on words,” Bulletin of the European Association of Theoretical Computer Science 54, 145–165.

    Google Scholar 

  • Rozenberg, G. and Salomaa, A., 1994, Cornerstones of Undecidability. International Series in Computer Science, Prentice Hall.

    Google Scholar 

  • Sahlqvist, H., 1975, “Completeness and correspondence in the first and second order semantics for modal logics,” in 3rd Scandinavian Logic Symposium, Uppsala, Sweden, 1973, S. Kanger, ed, pp. 110–143. North Holland.

  • Sattler, U., 1996, “A concept language extended with different kinds of transitive roles,” in 20. Deutsche Jahrestagung für Künstliche Intelligenz. LNM 1137, Springer.

  • Schmidt, R. and Hustadt, U., October 2004, “A principle for incorporating axioms into first-order translation of modal formulae,” Technical Report CSPP-22, The University of Manchester.

  • Spaan, E., 1993, Complexity of Modal Logics, PhD thesis, ILLC, Amsterdam University.

  • Straubing, H., 1994, Finite Automata, Formal Logic, and Circuit Complexity. Progress in Theoretical Computer Science. Birkhäuser.

    Google Scholar 

  • Szwast, W. and Tendera, L., 2001, “On the decision problem for the guarded fragment with transitivity,” in LICS’01, pp. 147–156.

  • Troelstra, A.S. and Schwichtenberg, H., 1996, Basic Proof Theory. Cambridge University Press.

  • Vakarelov, D., 1987, “Abstract characterization of some knowledge representation systems and the logic NIL of nondeterministic information,” in Artificial Intelligence: Methodology, Systems, Applications, Ph. Jorrand and V. Sgurev, eds., pp. 255–260. North-Holland, Amsterdam.

  • van Benthem, J., 1976, Correspondence Theory, PhD thesis, Mathematical Institute, University of Amsterdam.

  • van Benthem, J., 1984, “Correspondence theory,” in Handbook of Philosophical Logic, Volume II, D. Gabbay and F. Günthner, eds., pp. 167–247. Reidel, Dordrecht.

    Google Scholar 

  • Verma, K., 2003, Automates d’arbres bidirectionnels modulo théories équationnelles. PhD thesis, ENS de Cachan.

  • Wolter, F. and Zakharyashev, M., 1997, “On the relation between intuitionistic and classical modal logics,” Algebra and Logic 36, 121–155.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV/CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan 61, av. Pdt. Wilson, 94235, Cachan, Cedex, France

    Stéphane Demri

  2. Max Planck Institut für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken, Germany

    Hans De Nivelle

Authors
  1. Stéphane Demri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans De Nivelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stéphane Demri.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demri, S., De Nivelle, H. Deciding Regular Grammar Logics with Converse Through First-Order Logic. J Logic Lang Inf 14, 289–329 (2005). https://doi.org/10.1007/s10849-005-5788-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-005-5788-9

Keywords

Search

Navigation