{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:14Z","timestamp":1725495854773},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652243"},{"type":"electronic","value":"9783540494812"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49481-2_17","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:46:10Z","timestamp":1195933570000},"page":"220-234","source":"Crossref","is-referenced-by-count":5,"title":["Combining Topological and Qualitative Size Constraints for Spatial Reasoning"],"prefix":"10.1007","author":[{"given":"Alfonso","family":"Gerevini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"Renz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"J.F. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(1):832\u2013843, 1983.","journal-title":"Communication of the ACM"},{"key":"17_CR2","unstructured":"T. Apostol. Mathematical Analysis. Addison Wesley, 1974."},{"key":"17_CR3","unstructured":"C. Bessi\u00e8re. A simple way to improve path-consistency in Interval Algebra networks. In Proc. AAAI-96, pages 375\u2013380, 1996."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0004-3702(92)90043-W","volume":"55","author":"R. Dechter","year":"1992","unstructured":"R. Dechter. From local to global consistency. Artificial Intelligence, 55:87\u2013108, 1992.","journal-title":"Artificial Intelligence"},{"key":"17_CR5","unstructured":"A. Gerevini and J. Renz. Combining topological and qualitative size constraints for spatial reasoning. Technical report. To appear."},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1111\/j.1467-8640.1995.tb00043.x","volume":"11","author":"A. Gerevini","year":"1995","unstructured":"A. Gerevini and L. Schubert. On computing the minimal labels in time point algebra networks. Computational Intelligence, 11(3):443\u2013448, 1995.","journal-title":"Computational Intelligence"},{"issue":"5","key":"17_CR7","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1145\/174147.169675","volume":"40","author":"M. C. Golumbic","year":"1993","unstructured":"M. C. Golumbic and R. Shamir. Complexity and algorithms for reasoning about time: A graph-theoretic approach. Journal of the Association for Computing Machinery, 40(5):1128\u20131133, November 1993.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"17_CR8","unstructured":"H. A. Kautz and P.B. Ladkin. Integrating metric and qualitative temporal reasoning. In Proc. AAAI-91, pages 241\u2013246, 1991."},{"key":"17_CR9","volume-title":"Technical Report KES.U.88.8","author":"P. B. Ladkin","year":"1988","unstructured":"P. B. Ladkin and R. Maddux. On binary constraint networks. Technical Report KES.U.88.8, Kestrel Institute, Palo Alto, CA, 1988."},{"key":"17_CR10","unstructured":"G. Ligozat. A new proof of tractability for Ord-Horn relations. In Proc. AAAI-96, pages 715\u2013720, 1996."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A. K. Mackworth","year":"1985","unstructured":"A. K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65\u201373, 1985.","journal-title":"Artificial Intelligence"},{"key":"17_CR13","unstructured":"D. A. Randell, Z. Cui, and A.G. Cohn. A spatial logic based on regions and connection. In Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR\u201992), pages 165\u2013176, 1992."},{"key":"17_CR14","unstructured":"J. Renz. A canonical model of the Region Connection Calculus. In Principles of Knowledge Representation and Reasoning: Proceedings of the 6th International Conference (KR\u201998), pages 330\u2013341, 1998."},{"key":"17_CR15","unstructured":"J. Renz and B. Nebel. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. In Proc. IJ-CAI\u201997, pages 522\u2013527, 1997. Technical Report with full proofs available at \n                    http:\/\/www.informatik.uni-freiburg.de\/~sppraum\n                    \n                  ."},{"issue":"1-3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","volume":"58","author":"P. Beek van","year":"1992","unstructured":"P. van Beek. Reasoning about qualitative temporal information. Artificial Intelligence, 58(1-3):297\u2013321, 1992.","journal-title":"Artificial Intelligence"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/B978-1-4832-1447-4.50034-1","volume-title":"Readings in Qualitative Reasoning about Physical Systems","author":"M. Vilain","year":"1990","unstructured":"M. Vilain, H.A. Kautz, and P. van Beek. Constraint propagation algorithms for temporal reasoning: a revised report. In D.S. Weld and J. de Kleer, editors, Readings in Qualitative Reasoning about Physical Systems, pages 373\u2013381. Morgan Kaufmann, San Mateo, CA, 1990."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49481-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T21:40:14Z","timestamp":1551130814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49481-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652243","9783540494812"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49481-2_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}