{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:23Z","timestamp":1725486083114},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410539"},{"type":"electronic","value":"9783540453499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45349-0_35","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T00:54:55Z","timestamp":1181177695000},"page":"484-489","source":"Crossref","is-referenced-by-count":1,"title":["Some Observations on Durations, Scheduling and Allen\u2019s Algebra"],"prefix":"10.1007","author":[{"given":"Ola","family":"Angelsmark","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"issue":"11","key":"35_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. Communications of the ACM, 26(11):832\u2013843, 1983.","journal-title":"Communications of the ACM"},{"key":"35_CR2","first-page":"584","volume-title":"Advances in Intelligent Computing-IPMU\u201994","author":"F. D. Anger","year":"1994","unstructured":"F. D. Anger and R. V. Rodriguez. Effective scheduling of tasks under weak temporal interval constraints. In B. Bouchon-Meunier, R. R. Yager, and L. A. Zadeh, editors, Advances in Intelligent Computing-IPMU\u201994, pages 584\u2013594. Springer, Berlin, 1994."},{"key":"35_CR3","unstructured":"C.-C. Cheng and S. F. Smith. Generating Feasible Schedules under Complex Metric Constraints. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), pages 1086\u20131091. AAAI Press, 1994."},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1009777711218","volume":"3","author":"S. Belhadji","year":"1998","unstructured":"S. Belhadji and A. Isli. Temporal constraint satisfaction techniques in job shop scheduling problem solving. Constraints, 3:203\u2013212, 1998.","journal-title":"Constraints"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61\u201395, 1991.","journal-title":"Artificial Intelligence"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.340","volume":"7","author":"T. Drakengren","year":"1997","unstructured":"T. Drakengren and P. Jonsson. Eight maximal tractable subclasses of Allen\u2019s algebra with metric time. Journal of Artificial Intelligence Research, 7:25\u201345, 1997.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"35_CR7","unstructured":"T. Drakengren and P. Jonsson. Towards a complete classification of tractability in Allen\u2019s algebra. In IJCAI [9]."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"T. Drakengren and P. Jonsson. Twenty-one large tractable subclasses of Allen\u2019s algebra. Artificial Intelligence, 1997. To appear.","DOI":"10.1016\/S0004-3702(97)00021-0"},{"key":"35_CR9","unstructured":"Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan, Aug. 1997. Morgan Kaufmann."},{"issue":"1","key":"35_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0004-3702(98)00031-9","volume":"102","author":"P. Jonsson","year":"1998","unstructured":"P. Jonsson and C. B\u00e4ckstr\u00f6m. A unifying approach to temporal constraint reasoning. Artificial Intelligence, 102(1):143\u2013155, 1998.","journal-title":"Artificial Intelligence"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"M. Koubarakis. Tractable disjunctions of linear constraints. In Proceedings of the 2nd International Conference on Principles and Practice for Constraint Programming, pages 297\u2013307, Cambridge, MA, Aug. 1996.","DOI":"10.1007\/3-540-61551-2_82"},{"issue":"1\u20132","key":"35_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0004-3702(95)00109-3","volume":"87","author":"I. Meiri","year":"1996","unstructured":"I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87(1\u20132):343\u2013385, 1996.","journal-title":"Artificial Intelligence"},{"key":"35_CR13","unstructured":"I. Navarrete and R. Marin. Qualitative temporal reasoning with points and duarations. In IJCAI [9], pages 1454\u20131459."},{"issue":"1","key":"35_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"B. Nebel and H.-J. B\u00fcrckert. Reasoning about temporal relations: A maximal tractable subclass of Allen\u2019s interval algebra. Journal of the ACM, 42(1):43\u201366, 1995.","journal-title":"Journal of the ACM"},{"key":"35_CR15","unstructured":"A. K. Pujari and A. Sattar. A new framework for reasoning about points, intervals and durations. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 1259\u20131267, Stockholm, Sweden, 1999."},{"key":"35_CR16","first-page":"373","volume-title":"Readings in Qualitative Reasoning about Physical Systems","author":"M. B. Vilain","year":"1989","unstructured":"M. B. Vilain, H. A. Kautz, and P. G. 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, 1989."},{"key":"35_CR17","unstructured":"R. Wetprasit and A. Sattar. Temporal reasoning with qualitative and quantitative information about points and durations. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), pages 656\u2013663. AAAI Press, 1998."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45349-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T08:04:22Z","timestamp":1548317062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}