Abstract

A syntax transformation is presented that eliminates the modal logic operators from modal logic formulae by shifting the modal context information to the term level. The formulae in the transformed syntax can be brought into conjunctive normal form such that a clause based resolution calculus without any additional inference rule, but with special modal unification algorithms, can be defined. The method works for first-order modal logics with the two operators # and à and with constant-domain Kripke semantics where the accessibility relation is serial and may have any combination of the following properties: reflexivity, symmetry, transitivity. In particular the quantified versions of the modal systems T, S4, S5, B, D, D4 and DB can be treated. Extensions to non-serial and varying-domain systems are possible, but not presented here.

Citations

3	A many-sorted calculus with polymorphic functions based on resolution and paramodulation - Schmidt-Schau - 1985
1	What you always wanted to know about connection graphs - Eisinger - 1987
1	Ko75 R. Kowalski: A Proof Procedure Using Connection Graphs - &Co, London - 1968
1	Kr 59 S. Kripke. A Completeness Theorem in Modal Logic - No - 1975
1	Symbolic Logic, Vol 24, 1959, pp 1-14. Kr 63 S. Kripke. Semantical analysis of modal logic I, normal propositional calculi - of
1	of Kaiserslautern (forthcoming - Thesis, Univ - 1988
1	Paramodulation and theorem provcing in first order theories with equality - Vol - 1965