Skip to main content
SpringerLink
Log in

Modal Satisfiability Is in Deterministic Linear Space

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1862))

Included in the following conference series:

  • 404 Accesses

Abstract

In recent years, there has been a lot of interest in analyzing the space requirements for modal logics. In this paper, we prove that modal satisfiability is in deterministic linear space. This improves the best previously-known O(n log n) bound and it is the first linear space result in this area.

Supported in part by grant NSF-INT-9815095/DAAD-315-PPP-gü-ab.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Basin, S. Matthews, and L. Viganó. A new method for bounding the complexity of modal logics. In Proceedings of KGC’97, pp. 89–102. Springer, LNCS 1289, 1997.

    Google Scholar 

  2. D. Basin and L. Viganó. A recipe for the complexity analysis of non-classical logics. In Proceedings of FroCoS’98, pp. 57–75. Wiley, Studies in Logic and Computation 7, 2000.

    Google Scholar 

  3. A.K. Chandra, D. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28, pp. 114–133, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  4. J.Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54, pp. 319–379, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing, 6(3), pp. 467–480, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Hudelmaier. Improved decision procedures for the modal logics K, T and S4. In Proceedings of CSL’95, pp. 320–334. Springer, LNCS 1092, 1996.

    Google Scholar 

  7. L.A. Nguyen. A new space bound for the modal logics K4, KD4, and S4. In Proceedings of MFCS’99, pp. 321–331. Springer, LNCS 1672, 1999.

    Google Scholar 

  8. W.J. Paul, N. Pippinger, E. Szemerédy, and W.T. Trotter. On determinism versus non-determinism and related problems. In Proceedings of FOCS’83, pp. 429–438, 1983.

    Google Scholar 

  9. W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities, JCSS, 4, pp. 177–192, 1970.

    MATH  MathSciNet  Google Scholar 

  10. R.E. Stearns, J. Hartmanis, and P.M. Lewis II. Hierarchies of memory limited computations. In Proceedings of FOCS’65, pp. 179–190, 1965.

    Google Scholar 

  11. M. Y. Vardi. On the complexity of epistemic reasoning. In Proceedings of LICS’89, pp. 243–252, 1989.

    Google Scholar 

  12. L. Viganó. A framework for non-classical logics. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rochester Institute of Technology, Rochester, NY, 14623, USA

    Edith Hemaspaandra

Authors
  1. Edith Hemaspaandra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Department of Biology, Boston College, Fulton Hall 410B, Chestnut Hill, MA, 02467, USA

    Peter G. Clote

  2. Mathematisches Institut, Ludwig-Maximilian-Universität München, Theresienstr. 39, 80333, München, Germany

    Helmut Schwichtenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hemaspaandra, E. (2000). Modal Satisfiability Is in Deterministic Linear Space. In: Clote, P.G., Schwichtenberg, H. (eds) Computer Science Logic. CSL 2000. Lecture Notes in Computer Science, vol 1862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44622-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-44622-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67895-3

  • Online ISBN: 978-3-540-44622-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation