Abstract
The functional translation from modal logic into first-order predicate logic is revised. Quantifier elimination of second-order predicates is used to translate almost arbitrary modal systems, i.e. not only modal formulae, but also characteristic Hilbert axioms, fully automatically into predicate logic. Various optimizations of the functional translation are investigated. They even permit the translation of modal systems like the McKinsey axiom, whose correspondence property of the accessibility relation is not first-order axiomatizable. Quantifier exchange rules are defined for modifying the translated Hilbert axioms and thus simplifying their transformation into theory unification algorithms.
This work was supported by the ESPRIT project 3125 MEDLAR and the BMFT project LOGO (ITS 9102).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Wilhelm Ackermann. Untersuchung über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 110:390–413, 1935.
Yves Auffray and Patrice Enjalbert. Modal theorem proving: An equational viewpoint. Journal of Logic and Computation, 2(3):247–297, 1992.
Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Theorem proving for hierarchic first-order theories. In G. Levi and H. Kirchner, editors, Algebraic and Logic Programming, Third International Conference, pages 420–434. Springer-Verlag, LNCS 632, September 1992.
B. F. Chellas. Modal Logic: An Introduction. Cambridge University Press, Cambridge, 1980.
Farinas del Cerro, Luis and Andreas Herzig. Quantified modal logic and unification theory. Rapport LSI 293, Languages et Systèmes Informatique, Université Paul Sabatier, Toulouse, 1988.
M. C. Fitting. Proof Methods for Modal and Intuitionistic Logics, volume 169 of Synthese Library. D. Reidel Publishing Company, 1983.
Dov M. Gabbay and Hans Jürgen Ohlbach. From a Hilbert calculus to its model theoretic semantics. In Krysha Broda, editor, Proc. of the 4th UK Conference on Logic Programming, pages 218–252. Imperial College, London, Springer Verlag, Workshops in Computing Series, 1992.
G.E. Hughes and M.J. Cresswell. A Companion to Modal Logic. Methuen & Co., London, 1984.
L. Henkin. Some remarks on infinitely long formulas. In Infinistic Methods, pages 167–183. Pergamon Press, Oxford, 1961.
Andreas Herzig. Raisonnement automatique en logique modale et algorithmes d'unification. PhD thesis, Université Paul-Sabatier, Toulouse, 1989.
Ullrich Hustadt, Hans Jürgen Ohlbach, and Renate Schmidt. Qualified number restrictions and modal logic. forthcoming MPI report, 1993.
Hans Jürgen Ohlbach. A resolution calculus for modal logics. In Ewing Lusk and Ross Overbeek, editors, Proc. of 9th International Conference on Automated Deduction, CADE-88 Argonne, IL, volume 310 of Lecture Notes in Computer Science, pages 500–516, Berlin, Heidelberg, New York, 1988. Springer-Verlag, extended version: SEKI Report SR-88-08, FB Informatik, Universität Kaiserslautern, 1988.
Krister Segerberg. An essay in classical modal logic (3 vols.). Filosofiska studier, nr. 13, Uppsala Universitet, Uppsala, 1971.
Harold Simmons. An algorithm for eliminating predicate variables from π1/1 sentences, 1993. To appear in Journal of Logic and Computation.
Andrzej Szalas. On correspondence between modal and classical logic: Automated approach. Technical Report MPI-I-92-209, Max Planck Institut für Informatik, Saarbrücken, march 1992.
Johan van Benthem. Modal Logic and Classical Logic. Bibliopolis, Naples, 1983.
Johan van Benthem. Correspondence theory. In Gabbay Dov M and Franz Guenthner, editors, Handbook of Philosophical Logic, Vol. II, Extensions of Classical Logic, Synthese Library Vo. 165, pages 167–248. D. Reidel Publishing Company, Dordrecht, 1984.
Christoph Walther. A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence. Pitman Ltd., London, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohlbach, H.J. (1993). Optimized translation of multi modal logic into predicate logic. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1993. Lecture Notes in Computer Science, vol 698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56944-8_58
Download citation
DOI: https://doi.org/10.1007/3-540-56944-8_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56944-2
Online ISBN: 978-3-540-47830-0
eBook Packages: Springer Book Archive