{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:13:03Z","timestamp":1725495183019},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540756651"},{"type":"electronic","value":"9783540756668"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75666-8_1","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T00:23:17Z","timestamp":1195086197000},"page":"1-19","source":"Crossref","is-referenced-by-count":0,"title":["Reachability and Dependency Calculi: Reasoning in Network Algebras"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Scivos","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"1_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Comm. ACM\u00a026(11), 832\u2013843 (1983)","journal-title":"Comm. ACM"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-48085-3_10","volume-title":"CP 1999","author":"M. Broxvall","year":"1999","unstructured":"Broxvall, M., Jonsson, P.: Towards a complete classification of tractability in point algebras for nonlinear time. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 129\u2013143. Springer, Heidelberg (1999)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3540634932_1","volume-title":"KI 1997: Advances in Artificial Intelligence","author":"A.G. Cohn","year":"1997","unstructured":"Cohn, A.G.: Qualitative spatial representation and reasoning techniques. In: Brewka, G., Habel, C., Nebel, B. (eds.) KI 1997: Advances in Artificial Intelligence. LNCS, vol.\u00a01303, pp. 1\u201330. Springer, Heidelberg (1997)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Frank, A.: Qualitative Spatial Reasoning with Cardinal Directions. In: Proc. of the 7th Austrian Conf. on AI (1991)","DOI":"10.1007\/978-3-642-46752-3_17"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-54414-3_36","volume-title":"Advances in Spatial Databases","author":"M. Egenhofer","year":"1991","unstructured":"Egenhofer, M.: Reasoning about binary topological relations. In: G\u00fcnther, O., Schek, H.-J. (eds.) SSD 1991. LNCS, vol.\u00a0525, pp. 143\u2013160. Springer, Heidelberg (1991)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Freksa, C.: Using Orientation Information for Qualitative Spatial Reasoning. In: Theories and Methods of Spatial-Temporal in Geog. Spac. Reasoning","DOI":"10.1007\/3-540-55966-3_10"},{"key":"1_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1978","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1978)"},{"issue":"9","key":"1_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jvlc.1997.9999","volume":"1","author":"G. Ligozat","year":"1998","unstructured":"Ligozat, G.: Reasoning about cardinal diretions. J. of Vis. Lang. & Comp.\u00a01(9), 23\u201344 (1998)","journal-title":"J. of Vis. Lang. & Comp."},{"key":"1_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-28633-2_8","volume-title":"PRICAI 2004: Trends in Artificial Intelligence","author":"G. Ligozat","year":"2004","unstructured":"Ligozat, G., Renz, J.: What is a Qualitative Calculus? A General Framework. In: Zhang, C., W. Guesgen, H., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol.\u00a03157, pp. 53\u201364. Springer, Heidelberg (2004)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1090\/S0002-9947-1982-0662049-7","volume":"272","author":"R. Maddux","year":"1982","unstructured":"Maddux, R.: Some varieties containing relation algebras. Trans. AMS\u00a0272, 501\u2013526 (1982)","journal-title":"Trans. AMS"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci.\u00a07, 95\u2013132 (1974)","journal-title":"Inform. Sci."},{"key":"1_CR13","unstructured":"Moratz, R., Renz, J., Wolter, D.: Qualitative spatial reasoning about line segments. In: ECAI 2000 (2000)"},{"issue":"02","key":"1_CR14","first-page":"14","volume":"4","author":"B. Nebel","year":"2002","unstructured":"Nebel, B., Scivos, A.: Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning. K\u00fcnstliche Intelligenz, Heft\u00a04(02), 14\u201318 (2002)","journal-title":"K\u00fcnstliche Intelligenz, Heft"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ragni, M., Scivos, A.: Dependency Calculus: Reasoning in a General Point Algebra. In: Proc. of IJCAI 2005, pp. 1575\u20131576 (2005)","DOI":"10.1007\/11551263_6"},{"key":"1_CR16","unstructured":"Randell, D., Cui, Z., Cohn, A.: A Spatial Logic Based on Regions and Connection. In: Proceedings KR 1992, pp. 165\u2013176 (1992)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Spatial Information Theory. Foundations of Geographic Information Science","author":"A. Scivos","year":"2001","unstructured":"Scivos, A., Nebel, B.: Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation. In: Montello, D.R. (ed.) COSIT 2001. LNCS, vol.\u00a02205, Springer, Heidelberg (2001)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski, A.: On the calculus of relations. J. of Symb. Logic\u00a06, 73\u201389 (1941)","journal-title":"J. of Symb. Logic"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Vilain, M., Kautz, H., van Beek, P.: Contraint propagation algorithms for temporal reasoning: A revised report. Reasoning about Physical Systems, pp. 373\u2013381 (1989)","DOI":"10.1016\/B978-1-4832-1447-4.50034-1"}],"container-title":["Lecture Notes in Computer Science","Spatial Cognition V Reasoning, Action, Interaction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75666-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:58:59Z","timestamp":1556960339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75666-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540756651","9783540756668"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75666-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}