Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Resolution is a decision procedure for many propositional modal logics

Schmidt, Renate A.

MPI-I-97-2-002. January 1997, 60 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
The paper shows satisfiability in many propositional modal systems can
be decided by ordinary resolution procedures.
This follows from a general result that resolution and condensing is a
decision procedure for the satisfiability problem of formulae in
so-called \emph{path logics}.
Path logics arise from propositional and normal uni- and multi-modal
logics by the \emph{optimised functional translation} method.
The decision result provides an alternative decision proof for the
relevant modal logics (including \textit{K}, \textit{KD}, \textit{KT}
and \textit{KB}, their combinations as well as their multi-modal
versions), and related systems in artificial intelligence.
This alone is not interesting.
A more far-reaching consequence of the result has practical value,
namely, any standard first-order theorem prover that is based on
resolution can serve as a reasonable and efficient inference tool for
modal reasoning.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-97-2-002.ps423 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Schmidt, Renate A.},
  TITLE = {Resolution is a decision procedure for many propositional modal logics},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-97-2-002},
  MONTH = {January},
  YEAR = {1997},
  ISSN = {0946-011X},