{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:32Z","timestamp":1725489512824},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678953"},{"type":"electronic","value":"9783540446224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44622-2_22","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:32:38Z","timestamp":1187238758000},"page":"332-342","source":"Crossref","is-referenced-by-count":0,"title":["Modal Satisfiability Is in Deterministic Linear Space"],"prefix":"10.1007","author":[{"given":"Edith","family":"Hemaspaandra","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-63385-5_35","volume-title":"Proceedings of KGC\u201997","author":"D. Basin","year":"1997","unstructured":"D. Basin, S. Matthews, and L. Vigan\u00f3. A new method for bounding the complexity of modal logics. In Proceedings of KGC\u201997, pp. 89\u2013102. Springer, LNCS 1289, 1997."},{"key":"22_CR2","first-page":"57","volume":"7","author":"D. Basin","year":"2000","unstructured":"D. Basin and L. Vigan\u00f3. A recipe for the complexity analysis of non-classical logics. In Proceedings of FroCoS\u201998, pp. 57\u201375. Wiley, Studies in Logic and Computation 7, 2000.","journal-title":"Studies in Logic and Computation"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"A.K. Chandra, D. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28, pp. 114\u2013133, 1981.","journal-title":"Journal of the ACM"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J.Y. Halpern","year":"1992","unstructured":"J.Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54, pp. 319\u2013379, 1992.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing, 6(3), pp. 467\u2013480, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/3-540-61377-3_46","volume-title":"Proceedings of CSL\u201995","author":"J. Hudelmaier","year":"1996","unstructured":"J. Hudelmaier. Improved decision procedures for the modal logics K, T and S4. In Proceedings of CSL\u201995, pp. 320\u2013334. Springer, LNCS 1092, 1996."},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/3-540-48340-3_29","volume-title":"Proceedings of MFCS\u201999","author":"L.A. Nguyen","year":"1999","unstructured":"L.A. Nguyen. A new space bound for the modal logics K4, KD4, and S4. In Proceedings of MFCS\u201999, pp. 321\u2013331. Springer, LNCS 1672, 1999."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"W.J. Paul, N. Pippinger, E. Szemer\u00e9dy, and W.T. Trotter. On determinism versus non-determinism and related problems. In Proceedings of FOCS\u201983, pp. 429\u2013438, 1983.","DOI":"10.1109\/SFCS.1983.39"},{"key":"22_CR9","first-page":"177","volume":"4","author":"W. J. Savitch","year":"1970","unstructured":"W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities, JCSS, 4, pp. 177\u2013192, 1970.","journal-title":"JCSS"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"R.E. Stearns, J. Hartmanis, and P.M. Lewis II. Hierarchies of memory limited computations. In Proceedings of FOCS\u201965, pp. 179\u2013190, 1965.","DOI":"10.1109\/FOCS.1965.11"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi. On the complexity of epistemic reasoning. In Proceedings of LICS\u201989, pp. 243\u2013252, 1989.","DOI":"10.1109\/LICS.1989.39179"},{"key":"22_CR12","series-title":"PhD thesis","volume-title":"A framework for non-classical logics","author":"L. Vigan\u00f3","year":"1997","unstructured":"L. Vigan\u00f3. A framework for non-classical logics. PhD thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany, 1997."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44622-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:17:44Z","timestamp":1556756264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44622-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678953","9783540446224"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44622-2_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}