{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:02Z","timestamp":1725455582875},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024495","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"144-156","source":"Crossref","is-referenced-by-count":0,"title":["On-line algorithms for networks of temporal constraints"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Iacobini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"J.F. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(11), 1983.","DOI":"10.1145\/182.358434"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"F.D. Anger and R.V. Rodriguez. Effective scheduling of tasks under weak temporal interval constraints. Lecture Notes in Computer Science, 945, 1995.","DOI":"10.1007\/BFb0035991"},{"key":"14_CR3","first-page":"31","volume-title":"Proceedings of the Conference on Temporal Aspects in Information Systems","author":"J. Carmo","year":"1987","unstructured":"J. Carmo and A. Sernadas. A temporal logic framework for a layered approach to systems specification and verification. In Proceedings of the Conference on Temporal Aspects in Information Systems, pages 31\u201347, France, May 1987. AFCET."},{"key":"14_CR4","unstructured":"R. Cervoni, A. Cesta, and A. Oddi. Managing dynamic temporal constraint networks. In Proceedings of AIPS '94, 1994."},{"key":"14_CR5","unstructured":"E. Davis, 1989. Private communication reported in [6]."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49, 1991.","DOI":"10.1016\/0004-3702(91)90006-6"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"E.C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29, 1982.","DOI":"10.1145\/322290.322292"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"C.-C. Han and C.H. Lee. Comments on Mohr and Hendersons path consistency algorithms. Artificial Intelligence, 36, 1988.","DOI":"10.1016\/0004-3702(88)90081-1"},{"issue":"5","key":"14_CR9","doi-asserted-by":"crossref","first-page":"1104","DOI":"10.1137\/S0097539791218081","volume":"24","author":"C.-C. Han","year":"1995","unstructured":"C.-C. Han, K.-J. Lin, and J.W.-S. Liu. Scheduling jobs with temporal distance constraints. SIAM Journal on Computing, 24(5):1104\u20131121, 1995.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8, 1977.","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. Verification of concurrent programs: Temporal proof principle. In D. Kozen, editor, Logics of Programs (Proceedings 1981), LNCS 131, pages 200\u2013252. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0025785"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, pages 215\u2013273. Academic Press, 1981.","DOI":"10.21236\/ADA106750"},{"key":"14_CR13","unstructured":"I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. In Proc. of the 10th National Conference of the American Association for Artificial Intelligence (AAAI '91), 1991."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7, 1974.","DOI":"10.1016\/0020-0255(74)90008-5"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"B. Nebel and H.J. Biirckert. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42, 1995.","DOI":"10.1145\/200836.200848"},{"key":"14_CR16","unstructured":"H. Noltemeier and G. Schmitt. Incremental temporal constraint propagation. In Proc. of the 9th Florida Artificial Intelligence Research Symp. (FLAIRS '96), pages 25\u201329, 1996."},{"key":"14_CR17","unstructured":"J.S. Ostroff. Temporal Logic of Real-Time Systems. Research Studies Press, 1990."},{"key":"14_CR18","series-title":"Database Systems and Applications Series","volume-title":"Temporal Databases: Theory, Design, and Implementation","year":"1993","unstructured":"A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Database Systems and Applications Series. Benjamin\/Cummings, Redwood City, CA, 1993."},{"issue":"2","key":"14_CR19","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan. Amortized computational complexity. SIAM J. Algebraic Discrete Methods, 6(2):306\u2013318, 1985.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"P. van Beek. Reasoning about qualitative temporal information. Artificial intelligence, 58, 1992.","DOI":"10.1016\/0004-3702(92)90011-L"},{"key":"14_CR21","unstructured":"M. Vilain and H.A. Kautz. Constraint propagation algorithms for temporal reasoning. In Proc. of the 5th National Conference of the American Association for Artificial Intelligence (AAAI '86), 1986."},{"key":"14_CR22","doi-asserted-by":"crossref","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. Morgan Kaufman, 1989.","DOI":"10.1016\/B978-1-4832-1447-4.50034-1"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:35:56Z","timestamp":1586568956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0024495","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}