Using Resolution for Testing Modal Satisfiability and Building Models. Hustadt, U. & Schmidt, R. A. In Gent, I., van Maaren, H., & Walsh, T., editors, SAT2000: Highlights of Satisfiability Research in the Year 2000, volume 63, of Frontiers in Artificial Intelligence and Applications, pages 459-483. IOS Press, 2000.
Using Resolution for Testing Modal Satisfiability and Building Models [pdf]Paper  abstract   bibtex   
This paper presents a translation-based resolution decision procedure for the multi-modal logic K_m(a̧p,u̧p,o̧nv) 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.

Downloads: 0