A Resolution Calculus for Modal Logics

A Resolution Calculus for Modal Logics (1988)

by Hans Jürgen Ohlbach

Citations:

83 - 7 self

User correction supplied by mph

Datum	Value	Source
TITLE	A Resolution Calculus for Modal Logics	INFERENCE
AUTHOR NAME	Hans Jürgen Ohlbach	user correction
AUTHOR AFFIL	FB Informatik, University of Kaiserslautern	user correction
AUTHOR ADDR	Germany	user correction
ABSTRACT	A syntax transformation is presented that eliminates the modal logic operators from modal logic formulae by shifting the modal context information to the term level. The formulae in the transformed syntax can be brought into conjunctive normal form such that a clause based resolution calculus without any additional inference rule, but with special modal unification algorithms, can be defined. The method works for first-order modal logics with the two operators # and à and with constant-domain Kripke semantics where the accessibility relation is serial and may have any combination of the following properties: reflexivity, symmetry, transitivity. In particular the quantified versions of the modal systems T, S4, S5, B, D, D4 and DB can be treated. Extensions to non-serial and varying-domain systems are possible, but not presented here.	user correction
YEAR	1988	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	500--516	INFERENCE
VOLUME	310	INFERENCE
TECH	PhD thesis	INFERENCE
CITATIONS	15 found	ParsCit 1.0