MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Kazakov, Yevgenydblp
Editor(s):
Charatonik, Witold
Ganzinger, Harald		dblp
dblp
BibTeX cite key*:
Kazakov2002
Title, Booktitle
Title*:
Recursive resolution for modal logic
RecResML.dvi (20.96 KB)
Booktitle*:
Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi
Event, URLs
Conference URL::
http://www.mpi-sb.mpg.de/conferences/elics02/index.html
Downloading URL:
http://www.mpi-sb.mpg.de/conferences/elics02/report/kazakov.ps
Event Address*:
Saarbrücken, Germany
Language:
English
Event Date*
(no longer used):
-- March 2 - 7, 2002
Organization:
International Max Planck Research School for Computer Science (IMPRS)
Event Start Date:
4 March 2002
Event End Date:
6 March 2002
Publisher
Name*:
Max-Planck-Institut für Informatik
URL:
http://www.mpi-sb.mpg.de/
Address*:
Saarbrücken, Germany
Type:
Poster
Vol, No, Year, pp.
Series:
MPI Research Report
Volume:
MPI-I-2002-2-007
Number:
Month:
March
Pages:
11-15
Year*:
2002
VG Wort Pages:
ISBN/ISSN:
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
Resolution for the first order logic can be considered as a
practical tool for obtaining a decision procedures for some
theories (cf. \cite{arm}). For modal logics, however, there is
no uniform formulation of the resolution principle, yet the normal modal
logics are the most probable candidates to be decidable
theories. The translational methods for modal logic, treated for
instance in \cite{ohl}, yet possess some uniformness property, but does not
let one to extract proofs from the refutations. On the other hand,
direct methods (cf. \cite{far}, \cite{abadi}) are local which
gives not much practical use of them. This paper presents some
arguments on generalization of the classical propositional resolution
method to the language of modal logic. We give a resolution calculus
for modal logic $\K$ that inherits some features of classical resolution
and propose some suggestions of how can it be used for other modal logics.
Keywords:
Resolution, Modal logic
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:
@INPROCEEDINGS{Kazakov2002,
AUTHOR = {Kazakov, Yevgeny},
 EDITOR = {Charatonik, Witold and Ganzinger, Harald},
 TITLE = {Recursive resolution for modal logic},
 BOOKTITLE = {Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi},
 PUBLISHER = {Max-Planck-Institut für Informatik},
 YEAR = {2002},
 TYPE = {Poster},
 ORGANIZATION = {International Max Planck Research School for Computer Science (IMPRS)},
 VOLUME = {MPI-I-2002-2-007},
 PAGES = {11--15},
 SERIES = {MPI Research Report},
 ADDRESS = {Saarbr{\"u}cken, Germany},
 MONTH = {March},
}

Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Yevgeny Kazakov		Created
05/08/2003 05:01:09 PM
Revisions
6.
5.
4.
3.
2.		Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel		Edit Dates
01.09.2003 14:46:01
29.07.2003 15:14:51
29.07.2003 15:12:15
29.07.2003 15:08:29
07.07.2003 15:24:27

File Attachment Icon
RecResML.dvi