{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:30:17Z","timestamp":1725571817877},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666264"},{"type":"electronic","value":"9783540480853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48085-3_10","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T17:25:21Z","timestamp":1292520321000},"page":"129-143","source":"Crossref","is-referenced-by-count":8,"title":["Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Broxvall","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/65979.65982","volume":"11","author":"F. Anger","year":"1989","unstructured":"Anger, F.: On Lamport\u2019s interprocessor communication model. ACM Transactions on Programming Languages Systems\u00a011(3), 404\u2013417 (1989)","journal-title":"ACM Transactions on Programming Languages Systems"},{"key":"10_CR2","unstructured":"Anger, F., Mitra, D., Rodriguez, R.: Temporal constraint networks in nonlinear time. Technical report, ECAI Workshop on Temporal and Spatial Reasoning (1998)"},{"key":"10_CR3","unstructured":"Broxvall, M.: Computational complexity of point algebras for nonlinear time. Master Thesis Report LiTH-IDA-Ex-99\/48, Department of Computer Science, Link\u00f6ping, Sweden (June 1999)"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E. Clarke","year":"1986","unstructured":"Clarke, E., Emerson, E., Sistla, A.: utomatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages Systems\u00a08(2), 244\u2013263 (1986)","journal-title":"ACM Transactions on Programming Languages Systems"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0004-3702(88)90087-2","volume":"36","author":"T. Dean","year":"1988","unstructured":"Dean, T., Boddy, M.: Reasoning about partially ordered events. Artificial Intelligence\u00a036, 375\u2013399 (1988)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"A.E. Emerson","year":"1986","unstructured":"Emerson, A.E., Halpern, J.Y.: \u201cSometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear temporal logic. Journal of the ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of the ACM"},{"key":"10_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1613\/jair.379","volume":"6","author":"P. Jonsson","year":"1997","unstructured":"Jonsson, P., Drakengren, T.: A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research\u00a06, 211\u2013221 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: Part I\u2014a theory of interprocess communication. Journal of the ACM\u00a033(2), 313\u2013326 (1986)","journal-title":"Journal of the ACM"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1207\/s15516709cog0602_1","volume":"6","author":"D. McDermott","year":"1982","unstructured":"McDermott, D.: A temporal logic for reasoning about processes and plans. Cognitive Science\u00a06, 101\u2013155 (1982)","journal-title":"Cognitive Science"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"Nebel, B., B\u00fcrckert, H.-J.: Reasoning about temporal relations: A maximal tractable subclass of Allen\u2019s interval algebra. Journal of the ACM\u00a042(1), 43\u201366 (1995)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48085-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T15:59:07Z","timestamp":1553270347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48085-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666264","9783540480853"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48085-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}