{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:59:52Z","timestamp":1649087992600},"reference-count":26,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":3700,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s1570-8667(03)00031-5","type":"journal-article","created":{"date-parts":[[2003,11,27]],"date-time":"2003-11-27T12:12:55Z","timestamp":1069935175000},"page":"303-312","source":"Crossref","is-referenced-by-count":0,"title":["On-line algorithms for networks of temporal constraints"],"prefix":"10.1016","volume":"1","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":"78","reference":[{"issue":"11","key":"10.1016\/S1570-8667(03)00031-5_BIB001","doi-asserted-by":"crossref","DOI":"10.1145\/182.358434","article-title":"Maintaining knowledge about temporal intervals","volume":"26","author":"Allen","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB002","article-title":"Effective Scheduling of Tasks Under Weak Temporal Interval Constraints","volume":"945","author":"Anger","year":"1995"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB003","series-title":"Proceedings of the Conference on Temporal Aspects in Information Systems, France, AFCET","first-page":"31","article-title":"A temporal logic framework for a layered approach to systems specification and verification","author":"Carmo","year":"1987"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB004","series-title":"Proceedings of AIPS '94","article-title":"Managing dynamic temporal constraint networks","author":"Cervoni","year":"1994"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB005","series-title":"Proc. of the 23rd Int. Work. on Graph-Theoretic Concepts in Computer Science","first-page":"144","article-title":"On-line algorithms for networks of temporal constraints","volume":"1335","author":"d'Amore","year":"1997"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB006","unstructured":"E. Davis, Private communication reported in [7], 1989"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB007","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB008","doi-asserted-by":"crossref","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB009","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(88)90081-1","article-title":"Comments on Mohr and Henderson's path consistency algorithms","volume":"36","author":"Han","year":"1988","journal-title":"Artificial Intelligence"},{"issue":"5","key":"10.1016\/S1570-8667(03)00031-5_BIB010","doi-asserted-by":"crossref","first-page":"1104","DOI":"10.1137\/S0097539791218081","article-title":"Scheduling jobs with temporal distance constraints","volume":"24","author":"Han","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1570-8667(03)00031-5_BIB011","unstructured":"F. Iacobini, On-line algorithms for maintaining the consistency in network of temporal constraints, Master's Thesis, School of Electrical Engineering, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 1996 (in Italian)"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB012","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB013","series-title":"Logics of Programs, Proceedings 1981","first-page":"200","article-title":"Verification of concurrent programs: Temporal proof principle","volume":"131","author":"Manna","year":"1981"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB014","series-title":"The Correctness Problem in Computer Science","first-page":"215","article-title":"Verification of concurrent programs: the temporal framework","author":"Manna","year":"1981"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB015","series-title":"Proc. of the 10th National Conference of the American Association for Artificial Intelligence","article-title":"Combining qualitative and quantitative constraints in temporal reasoning","author":"Meiri","year":"1991"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB016","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inform. Sci."},{"key":"10.1016\/S1570-8667(03)00031-5_BIB017","doi-asserted-by":"crossref","DOI":"10.1145\/200836.200848","article-title":"Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra","volume":"42","author":"Nebel","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB018","series-title":"Temporal Logic of Real-Time Systems","author":"Ostroff","year":"1990"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB019","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0004-3702(97)00009-X","article-title":"Processing disjunctions in temporal constraint networks","volume":"93","author":"Schwalb","year":"1997","journal-title":"Artificial Intelligence"},{"issue":"2\/3","key":"10.1016\/S1570-8667(03)00031-5_BIB020","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1009717525330","article-title":"Temporal constraints: A survey","volume":"3","author":"Schwalb","year":"1998","journal-title":"Constraints Internat. J."},{"key":"10.1016\/S1570-8667(03)00031-5_BIB021","series-title":"Temporal Databases: Theory, Design, and Implementation","year":"1993"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB022","series-title":"Series on Database Systems and Applications","article-title":"Temporal Databases","author":"Tansel","year":"1993"},{"issue":"2","key":"10.1016\/S1570-8667(03)00031-5_BIB023","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB024","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(92)90011-L","article-title":"Reasoning about qualitative temporal information","volume":"58","author":"van Beek","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB025","series-title":"Proc. of the 5th National Conference of the American Association for Artificial Intelligence","article-title":"Constraint propagation algorithms for temporal reasoning","author":"Vilain","year":"1986"},{"key":"10.1016\/S1570-8667(03)00031-5_BIB026","series-title":"Readings in Qualitative Reasoning About Physical Systems","article-title":"Constraint propagation algorithms for temporal reasoning: A revised report","author":"Vilain","year":"1989"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000315?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000315?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T17:58:00Z","timestamp":1550339880000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":26,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S1570866703000315"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00031-5","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}