{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:33:56Z","timestamp":1774416836433,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6110,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/0004-3702(95)00109-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"343-385","source":"Crossref","is-referenced-by-count":120,"title":["Combining qualitative and quantitative constraints in temporal reasoning"],"prefix":"10.1016","volume":"87","author":[{"given":"Itay","family":"Meiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00109-3_BIB1","doi-asserted-by":"crossref","first-page":"832","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\/0004-3702(95)00109-3_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90061-0","article-title":"Temporal data base management","volume":"32","author":"Dean","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","article-title":"Experimental evaluation of preprocessing algorithms for constraint satisfaction problems","volume":"68","author":"Dechter","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB6","series-title":"Proceedings IJCAI-91","first-page":"325","article-title":"An efficient arc consistency algorithm for a class of CSP problems","author":"Deville","year":"1991"},{"key":"10.1016\/0004-3702(95)00109-3_BIB7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition of backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00109-3_BIB8","author":"Garey","year":"1979"},{"key":"10.1016\/0004-3702(95)00109-3_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/174147.169675","article-title":"Complexity and algorithms for reasoning about time: a graph-theoretic approach","author":"Golumbic","year":"1991"},{"key":"10.1016\/0004-3702(95)00109-3_BIB10","series-title":"Proceedings AAAI-91","first-page":"241","article-title":"Integrating metric and qualitative temporal reasoning","author":"Kautz","year":"1991"},{"key":"10.1016\/0004-3702(95)00109-3_BIB11","series-title":"Proceedings KR-92","first-page":"24","article-title":"Dense time and temporal constraints with \u2260","author":"Koubarakis","year":"1992"},{"key":"10.1016\/0004-3702(95)00109-3_BIB12","series-title":"Proceedings Principles and Practice of Constraint Programming\u2014CP95","first-page":"53","article-title":"From local to global consistency in temporal constraint networks","author":"Koubarakis","year":"1995"},{"key":"10.1016\/0004-3702(95)00109-3_BIB13","article-title":"Metric constraint satisfaction with intervals","author":"Ladkin","year":"1989"},{"key":"10.1016\/0004-3702(95)00109-3_BIB14","article-title":"On binary constraint networks","author":"Ladkin","year":"1989"},{"key":"10.1016\/0004-3702(95)00109-3_BIB15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0004-3702(92)90106-8","article-title":"Effective solutions of qualitative interval constraint problems","volume":"57","author":"Ladkin","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problems","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB18","article-title":"Faster constraint satisfaction algorithms for temporal reasoning","author":"Meiri","year":"1990"},{"key":"10.1016\/0004-3702(95)00109-3_BIB19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","article-title":"Arc and path consistency revisited","volume":"28","author":"Mohr","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00109-3_BIB20","doi-asserted-by":"crossref","first-page":"95","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\/0004-3702(95)00109-3_BIB21","series-title":"Proceedings AAA1-94","first-page":"356","article-title":"Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra","author":"Nebel","year":"1994"},{"key":"10.1016\/0004-3702(95)00109-3_BIB22","series-title":"Proceedings AAAI-91","first-page":"253","article-title":"Metric constraints for maintaining appointments: dates and repeated activities","author":"Poesio","year":"1991"},{"key":"10.1016\/0004-3702(95)00109-3_BIB23","series-title":"Proceedings AAAI-93","first-page":"2","article-title":"Coping with disjunctions in temporal constraint satisfaction problems","author":"Schwalb","year":"1993"},{"key":"10.1016\/0004-3702(95)00109-3_BIB24","article-title":"Processing temporal constraint networks","author":"Schwalb","year":"1995"},{"key":"10.1016\/0004-3702(95)00109-3_BIB25","article-title":"Exact and approximate reasoning about qualitative temporal relations","author":"van Beek","year":"1990"},{"key":"10.1016\/0004-3702(95)00109-3_BIB26","series-title":"Proceedings AAAI-90","first-page":"728","article-title":"Reasoning about qualitative temporal information","author":"van Beek","year":"1990"},{"key":"10.1016\/0004-3702(95)00109-3_BIB27","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/210346.210347","article-title":"On the minimality and global consistency of row-convex constraint networks","volume":"42","author":"van Beek","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00109-3_BIB28","series-title":"Proceedings AAAI-82","first-page":"197","article-title":"A system for reasoning about time","author":"Vilain","year":"1982"},{"key":"10.1016\/0004-3702(95)00109-3_BIB29","series-title":"Proceedings AAAI-86","first-page":"377","article-title":"Constraint propagation algorithms for temporal reasoning","author":"Vilain","year":"1986"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:28:09Z","timestamp":1555050489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295001093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0004370295001093"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00109-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}