{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:13:36Z","timestamp":1725747216705},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642397172"},{"type":"electronic","value":"9783642397189"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39718-9_14","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T03:01:54Z","timestamp":1377831714000},"page":"231-248","source":"Crossref","is-referenced-by-count":13,"title":["Proof Theory of a Multi-Lane Spatial Logic"],"prefix":"10.1007","author":[{"given":"Sven","family":"Linker","sequence":"first","affiliation":[]},{"given":"Martin","family":"Hilscher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-24559-6_28","volume-title":"Formal Methods and Software Engineering","author":"M. Hilscher","year":"2011","unstructured":"Hilscher, M., Linker, S., Olderog, E.-R., Ravn, A.P.: An abstract model for proving safety of multi-lane traffic manoeuvres. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol.\u00a06991, pp. 404\u2013419. Springer, Heidelberg (2011)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MC.1985.1662795","volume":"18","author":"B. Moszkowski","year":"1985","unstructured":"Moszkowski, B.: A temporal logic for multilevel reasoning about hardware. Computer\u00a018, 10\u201319 (1985)","journal-title":"Computer"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Z. Chaochen","year":"1991","unstructured":"Chaochen, Z., Hoare, C.A.R., Ravn, A.P.: A calculus of durations. Information Processing Letters\u00a040, 269\u2013276 (1991)","journal-title":"Information Processing Letters"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-31862-0_33","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"A. Sch\u00e4fer","year":"2005","unstructured":"Sch\u00e4fer, A.: A calculus for shapes in time and space. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol.\u00a03407, pp. 463\u2013477. Springer, Heidelberg (2005)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1005003904639","volume":"60","author":"D. Basin","year":"1998","unstructured":"Basin, D., Matthews, S., Vigan\u00f3, L.: Natural deduction for non-classical logics. Studia Logica\u00a060, 119\u2013160 (1998)","journal-title":"Studia Logica"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-44802-0_22","volume-title":"Computer Science Logic","author":"T.M. Rasmussen","year":"2001","unstructured":"Rasmussen, T.M.: Labelled natural deduction for interval logics. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol.\u00a02142, pp. 308\u2013323. Springer, Heidelberg (2001)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-56503-5_8","volume-title":"STACS 93","author":"M.R. Zhou Chaochen","year":"1993","unstructured":"Zhou Chaochen, M.R., Hansen, Sestoft, P.: Decidability and undecidability results for duration calculus. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds.) STACS 1993. LNCS, vol.\u00a0665, pp. 58\u201368. Springer, Heidelberg (1993)"},{"key":"14_CR8","unstructured":"Woodcock, J., Davies, J.: Using Z \u2013 Specification, Refinement, and Proof. Prentice Hall (1996)"},{"key":"14_CR9","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc. (1967)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M.: Labelled deductive systems. vol.\u00a01. Oxford University Press (1996)","DOI":"10.1093\/oso\/9780198538332.003.0001"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Vigan\u00f2, L.: Labelled Non-Classical Logics. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4757-3208-5"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/LICS.1995.523242","volume-title":"Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, LICS 1995","author":"B. Dutertre","year":"1995","unstructured":"Dutertre, B.: Complete proof systems for first order interval temporal logic. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, LICS 1995, p. 36. IEEE Computer Society, Washington, DC (1995)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"van Benthem, J., Bezhanishvili, G.: Modal logics of space. In: Aiello, M., Pratt-Hartmann, I., Benthem, J. (eds.) Handbook of Spatial Logics, pp. 217\u2013298. Springer (2007)","DOI":"10.1007\/978-1-4020-5587-4_5"},{"key":"14_CR14","unstructured":"Randell, D.A., Cui, Z., Cohn, A.G.: A Spatial Logic based on Regions and Connection. In: Proc. 3rd Int\u2019l Conf. on Knowledge Representation and Reasoning (1992)"},{"key":"14_CR15","unstructured":"Gabbay, D.M., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-dimensional modal logics: theory and applications. Studies in Logic and the Foundations of Mathematics, vol.\u00a0148. Elsevier (2003)"},{"key":"14_CR16","unstructured":"Simpson, A.K.: The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, University of Edinburgh (1994)"},{"key":"14_CR17","unstructured":"Caleiro, C., Sernadas, A., Sernadas, C.: Fibring logics: Past, present and future. In: We Will Show Them! Essays in Honour of Dov Gabbay, vol.\u00a01, pp. 363\u2013388 (2005)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1093\/logcom\/12.3.443","volume":"12","author":"J. Rasga","year":"2002","unstructured":"Rasga, J., Sernadas, A., Sernadas, C., Vigan\u00f3, L.: Fibring labelled deduction systems. Journal of Logic and Computation\u00a012, 443\u2013473 (2002)","journal-title":"Journal of Logic and Computation"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Paulson, L.: Isabelle: A Generic Theorem Prover. Springer (1994)","DOI":"10.1007\/BFb0030541"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39718-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T12:56:09Z","timestamp":1715950569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39718-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397172","9783642397189"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39718-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}