MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Basin, David A.
Matthews, Seán
Viganò, Luca		dblp
dblp
dblp
Editor(s):
Gottlob, G.
Leitsch, A.
Mundici, D.		dblp
dblp
dblp
BibTeX cite key*:
Basin97d
Title, Booktitle
Title*:
A New Method for Bounding the Complexity of Modal Logics
Booktitle*:
Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC-97)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Vienna, Austria
Language:
English
Event Date*
(no longer used):
August, 25 - 29
Organization:
Event Start Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Event End Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
1289
Number:
Month:
Pages:
89-102
Year*:
1997
VG Wort Pages:
ISBN/ISSN:
3-540-63385-5
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
We present a new proof-theoretic approach to bounding the complexity
of the decision problem for propositional modal logics. We formalize
logics in a uniform way as sequent systems and then restrict the
structural rules for particular systems. This, combined with an
analysis of the accessibility relation of the corresponding Kripke
structures, yields decision procedures with bounded space requirements.
As examples we give O(n log n) procedures for the modal logics K and T.
Download
Access Level:

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



BibTeX Entry:
@INPROCEEDINGS{Basin97d,
AUTHOR = {Basin, David A. and Matthews, Se{\'a}n and Vigan{\`o}, Luca},
 EDITOR = {Gottlob, G. and Leitsch, A. and Mundici, D.},
 TITLE = {A New Method for Bounding the Complexity of Modal Logics},
 BOOKTITLE = {Proceedings of the 5th Kurt G{\"o}del Colloquium on Computational Logic and Proof Theory (KGC-97)},
 PUBLISHER = {Springer},
 YEAR = {1997},
 VOLUME = {1289},
 PAGES = {89--102},
 SERIES = {Lecture Notes in Computer Science},
 ADDRESS = {Vienna, Austria},
 ISBN = {3-540-63385-5},
}

Entry last modified by Anja Becker, 11/29/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)
Luca Viganò		Created
04/25/1997 04:28:02 PM
Revisions
10.
9.
8.
7.
6.		Editor(s)
Anja Becker
Uwe Brahm
Uwe Brahm
Seán Matthews
Seán Matthews		Edit Dates
29.11.2010 14:17:10
04/02/98 07:49:07 PM
02/26/98 03:06:18 PM
21/01/98 13:00:14
21/01/98 12:26:53