User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Conference Paper

Recursive resolution for modal logic


Kazakov,  Yevgeny
Programming Logics, MPI for Informatics, Max Planck Society;


Charatonik,  Witold
Programming Logics, MPI for Informatics, Max Planck Society;


Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Kazakov, Y. (2002). Recursive resolution for modal logic. In Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi (pp. 11-15). Saarbrücken, Germany: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3052-B
Resolution for the first order logic can be considered as a practical tool for obtaining a decision procedures for some theories (cf. \cite{arm}). For modal logics, however, there is no uniform formulation of the resolution principle, yet the normal modal logics are the most probable candidates to be decidable theories. The translational methods for modal logic, treated for instance in \cite{ohl}, yet possess some uniformness property, but does not let one to extract proofs from the refutations. On the other hand, direct methods (cf. \cite{far}, \cite{abadi}) are local which gives not much practical use of them. This paper presents some arguments on generalization of the classical propositional resolution method to the language of modal logic. We give a resolution calculus for modal logic $\K$ that inherits some features of classical resolution and propose some suggestions of how can it be used for other modal logics.