The axiomatic translation principle for modal logic
Open Access
- 1 August 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 8 (4) , 19
Abstract
In this paper we present a translation principle, called the axiomatic translation , for reducing propositional modal logics with background theories, including triangular properties such as transitivity, Euclideanness and functionality, to decidable fragments of first-order logic. The goal of the axiomatic translation principle is to find simplified theories, which capture the inference problems in the original theory, but in a way that can be readily automated and is easier to deal with by existing (first-order) theorem provers than the standard translation. The principle of the axiomatic translation is conceptually very simple and can be almost completely automated. Soundness is automatic under reasonable assumptions, general decidability results can be stated and termination of ordered resolution is easily achieved. The non-trivial part of the approach is proving completeness. We prove results of completeness, decidability, model generation, the small model property and the interpolation property for a number of common and less common modal logics. We also present results of experiments with a number of first-order logic theorem provers which are very encouraging.Keywords
This publication has 29 references indexed in Scilit:
- Deciding the guarded fragments by resolutionJournal of Symbolic Computation, 2003
- The Complexity of Regularity in Grammar Logics and Related Modal LogicsJournal of Logic and Computation, 2001
- Reducing Modal Consequence RelationsJournal of Logic and Computation, 2001
- Resolution-based methods for modal logicsLogic Journal of the IGPL, 2000
- On the Restraining Power of GuardsThe Journal of Symbolic Logic, 1999
- Highway to the Danger ZoneJournal of Logic and Computation, 1995
- An optimality result for clause form translationJournal of Symbolic Computation, 1992
- Using the Universal Modality: Gains and QuestionsJournal of Logic and Computation, 1992
- A Structure-preserving Clause Form TranslationJournal of Symbolic Computation, 1986
- Complexity results for classes of quantificational formulasJournal of Computer and System Sciences, 1980