BibTeX
@MISC{Fitting89destructivemodal,
author = {Melvin Fitting},
title = {Destructive Modal Resolution},
year = {1989}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present non-clausal resolution systems for propositional modal logics whose Kripke models do not involve symmetry, and for first order versions whose Kripke models do not involve constant domains. We give systems for K, T , K4 and S4; other logics are also possible. Our systems do not require preliminary reduction to a normal form and, in the first order case, intermingle resolution steps with Skolemization steps.
Citations
| 211 | Automated Theorem Proving: A Logical Basis - Loveland - 1987 |
| 164 | The computational complexity of provability in systems of modal propositional logic - Ladner - 1977 |
| 84 | First Order Logic - Smullyan - 1968 |
| 26 | On the complexity of epistemic reasoning - Vardi - 1989 |
| 23 | Matrix proof methods for modal logics - Wallen - 1987 |
| 11 | A Resolution Method for Quantified Modal Logics of Knowledge and Belief - Geissler, Konolige - 1986 |
| 9 | Modal Logic Should Say More Than It Does - Fitting - 1991 |
| 9 | Resolution calculi for modal logics - Mints |
| 1 | review of “Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic,” by - Mints - 1987 |
| 1 | Cutfree formalizations and resolution method for propositional modal logics - Mints - 1987 |
| 1 | The programming system - Mints, Tyugu - 1987 |
| 1 | A Resolution Calculus for modal logics, CADE-9, pp 500–516 - Ohlbach - 1988 |
