U. Hustadt and R. A. Schmidt (2002a): ``Using resolution for testing modal satisfiability and building models.'' Journal of Automated Reasoning 28(2):205-232.
Abstract, BiBTeX, Abstract + PDF (© Springer).

This paper presents a translation-based resolution decision procedure for the multi-modal logic K_m(\cap,\cup,\conv) defined over families of relations closed under intersection, union and converse. The relations may satisfy certain additional frame properties. Different from previous resolution decision procedures which are based on ordering refinements our procedure is based on a selection refinement, the derivations of which correspond to derivations of tableaux or sequent proof systems. This procedure has the advantage that it can be used both as a satisfiability checker and a model builder. We show that tableaux and sequent-style proof systems can be polynomially simulated with our procedure. Furthermore, the finite model property follows for a number of extended modal logics. [an error occurred while processing this directive]