Document Open Access Logo

On the Complexity of Elementary Modal Logics

Authors Edith Hemaspaandra, Henning Schnoor

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2008.1356.pdf
  • Filesize: 267 kB
  • 12 pages

Document Identifiers

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Modal logics are widely used in computer science.  The complexity
   of modal satisfiability problems has been investigated since the
   1970s, usually proving results on a case-by-case basis.  We prove a
   very general classification for a wide class of relevant logics:
   Many important subclasses of modal logics can be obtained by
   restricting the allowed models with first-order Horn formulas.  We
   show that the satisfiability problem for each of these logics is
   either NP-complete or PSPACE-hard, and exhibit a simple
   classification criterion.  Further, we prove matching PSPACE upper
   bounds for many of the PSPACE-hard logics.

Cite As Get BibTex

Edith Hemaspaandra and Henning Schnoor. On the Complexity of Elementary Modal Logics. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 349-360, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/LIPIcs.STACS.2008.1356

Author Details

Edith Hemaspaandra
Henning Schnoor
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact