{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:54:03Z","timestamp":1773939243055,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709176","type":"print"},{"value":"9783540709183","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_48","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"561-572","source":"Crossref","is-referenced-by-count":12,"title":["Bounded-Variable Fragments of Hybrid Logics"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Schwentick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-48168-0_22","volume-title":"Computer Science Logic","author":"C. Areces","year":"1999","unstructured":"Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 307\u2013321. Springer, Heidelberg (1999)"},{"issue":"5","key":"48_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1093\/jigpal\/8.5.653","volume":"8","author":"C. Areces","year":"2000","unstructured":"Areces, C., Blackburn, P., Marx, M.: The computational complexity of hybrid temporal logics. Logic Journal of the IGPL\u00a08(5), 653\u2013679 (2000)","journal-title":"Logic Journal of the IGPL"},{"issue":"3","key":"48_CR3","doi-asserted-by":"publisher","first-page":"977","DOI":"10.2307\/2695090","volume":"66","author":"C. Areces","year":"2001","unstructured":"Areces, C., Blackburn, P., Marx, M.: Hybrid logics: Characterization, interpolation and complexity. Journal of Symbolic Logic\u00a066(3), 977\u20131010 (2001)","journal-title":"Journal of Symbolic Logic"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/SFCS.1991.185392","volume-title":"Proc. of 32nd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proc. of 32nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Franceschet, M., de Rijke, M.: Model checking hybrid logics (with an application to semistructured data). Journal of Applied Logic (2005)","DOI":"10.1016\/j.jal.2005.06.010"},{"key":"48_CR6","first-page":"192","volume-title":"10th TIME \/ 4th ICTL","author":"M. Franceschet","year":"2003","unstructured":"Franceschet, M., de Rijke, M., Schlingloff, B.-H.: Hybrid logics on linear structures: Expressivity and complexity. In: 10th TIME \/ 4th ICTL, pp. 192\u2013202. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-51803-7_36","volume-title":"Temporal Logic in Specification","author":"D.M. Gabbay","year":"1989","unstructured":"Gabbay, D.M.: The declarative past and imperative future: Executable temporal logic for interactive systems. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol.\u00a0398, pp. 409\u2013448. Springer, Heidelberg (1989)"},{"key":"48_CR8","first-page":"163","volume-title":"Conference Record of the 7th Annual ACM Symposium on Principles of Programming Languages (POPL\u201980)","author":"D.M. Gabbay","year":"1980","unstructured":"Gabbay, D.M., et al.: On the temporal basis of fairness. In: Conference Record of the 7th Annual ACM Symposium on Principles of Programming Languages (POPL\u201980), pp. 163\u2013173. ACM Press, New York (1980)"},{"issue":"2","key":"48_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0304-3975(96)00119-3","volume":"169","author":"N. Globerman","year":"1996","unstructured":"Globerman, N., Harel, D.: Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science\u00a0169(2), 161\u2013184 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"48_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(91)90208-Y","volume":"38","author":"P. Goral\u010dik","year":"1991","unstructured":"Goral\u010dik, P., Goral\u010dikov\u00e1, A., Koubek, V.: Alternation with a pebble. Information Processing Letters\u00a038(1), 7\u201313 (1991)","journal-title":"Information Processing Letters"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(05)80006-7","volume":"40","author":"T. Jiang","year":"1991","unstructured":"Jiang, T., Ravikumar, B.: A note on the space complexity of some desicion problems for finite automata. Information Processing Letters\u00a040, 25\u201331 (1991)","journal-title":"Information Processing Letters"},{"key":"48_CR12","unstructured":"Kamp, H.: Tense logic and the Theory of Linear Order. PhD thesis, University of California Los Angeles (1968)"},{"key":"48_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-44685-0_35","volume-title":"CONCUR 2001 - Concurrency Theory","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: Extended temporal logic revisited. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 519\u2013535. Springer, Heidelberg (2001)"},{"key":"48_CR14","unstructured":"Mostowski, A.W.: Games with forbidden positions. Technical report, Uniwersytet Gdanski, Instytut Matematyki (1991)"},{"key":"48_CR15","unstructured":"Mundhenk, M., et al.: Complexity of hybrid logics over transitive frames. In: Proc. of M4M-4. Informatik-Berichte, vol.\u00a0194, pp. 62\u201378. Humboldt-Universit\u00e4t, Berlin (2005)"},{"key":"48_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45744-5_7","volume-title":"Automated Reasoning","author":"U. Sattler","year":"2001","unstructured":"Sattler, U., Vardi, M.Y.: The hybrid \u03bc-calculus. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 76\u201391. Springer, Heidelberg (2001)"},{"key":"48_CR17","unstructured":"Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. PhD thesis, MIT (1974)"},{"key":"48_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11538363_24","volume-title":"Computer Science Logic","author":"B. Cate ten","year":"2005","unstructured":"ten Cate, B., Franceschet, M.: On the complexity of hybrid logics with binders. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 339\u2013354. Springer, Heidelberg (2005)"},{"key":"48_CR19","series-title":"Lecture Notes in Pure and Applied Mathematics","first-page":"331","volume-title":"Complexity, Logic, and Recursion Theory","author":"P. Emde Boas van","year":"1997","unstructured":"van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Applied Mathematics, vol.\u00a0187, pp. 331\u2013363. Marcel Dekker, New York (1997)"},{"key":"48_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/3-540-57887-0_116","volume-title":"Theoretical Aspects of Computer Software","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y.: Nontraditional applications of automata theory. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 575\u2013597. Springer, Heidelberg (1994)"},{"key":"48_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"},{"key":"48_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"},{"issue":"1","key":"48_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation\u00a0115(1), 1\u201337 (1994)","journal-title":"Information and Computation"},{"key":"48_CR24","first-page":"185","volume-title":"24th Annual Symposium on Foundations of Computer Science (FOCS)","author":"P. Wolper","year":"1983","unstructured":"Wolper, P., Vardi, M.Y., Sistla, A.P.: Reasoning about infinite computation paths (extended abstract). In: 24th Annual Symposium on Foundations of Computer Science (FOCS), pp. 185\u2013194. IEEE Computer Society Press, Los Alamitos (1983)"},{"key":"48_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata and infinite trees. Theoretical Computer Science\u00a0200, 135\u2013183 (1998)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:57Z","timestamp":1605762717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_48","relation":{},"subject":[]}}