论文信息 - Generic Resolution in Propositional Modal Systems

Generic Resolution in Propositional Modal Systems

We present a generic method to obtain resolution systems for modal propositional logics. The rules of a resolution system for a modal logic can be derived from the frame properties that characterize the logic. We characterize the set of frame properties for which our method works.

Hans de Nivelle

[1] Annie Foret,et al. Rewrite Rule Systems for Modal Propositional Logic , 1988, J. Log. Program..

[2] R. Sommerhalder. A Resolution Method for some Systems of Modal Logic , 1992 .

[3] Luis Fariñas del Cerro,et al. Linear Modal Deductions , 1988, CADE.

[4] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[5] Max J. Cresswell,et al. A companion to modal logic , 1984 .

[6] Melvin Fitting,et al. Destructive Modal Resolution , 1990, J. Log. Comput..

[7] Patrice Enjalbert,et al. Modal Resolution in Clausal Form , 1989, Theor. Comput. Sci..

[8] Hans Jürgen Ohlbach,et al. A Resolution Calculus for Modal Logics , 1988, CADE.

[9] R. Goldblatt. Logics of Time and Computation , 1987 .