Recursive resolution for modal logic
Yevgeny Kazakov
Abstract
Resolution for the first order logic can be considered as a practical tool for obtaining a decision procedures for some theories (cf. 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 ohl, yet possess some uniformness property, but does not let one to extract proofs from the refutations. On the other hand, direct methods (cf. far, 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
Details
| Address |
Saarbrücken‚ Germany |
| Book Title |
Proceedings of the Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi |
| Month |
March |
| Organization |
International Max Planck Research School for Computer Science (IMPRS) |
| Pages |
11–15 |
| Publisher |
Max−Planck−Institut für Informatik |
| Series |
Max−Planck−Institut für Informatik Research Report |
| Volume |
MPI−I−2002−2−007 |
| Year |
2002 |
Links
Related pages
|
People |
|
|
Activities |