{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T13:16:28Z","timestamp":1783602988573,"version":"3.55.0"},"reference-count":50,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0004-3702(91)90006-6","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"61-95","source":"Crossref","is-referenced-by-count":963,"title":["Temporal constraint networks"],"prefix":"10.1016","volume":"49","author":[{"given":"Rina","family":"Dechter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Itay","family":"Meiri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Judea","family":"Pearl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(91)90006-6_BIB1","author":"Aho","year":"1974"},{"issue":"11","key":"10.1016\/0004-3702(91)90006-6_BIB2","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":"Commun. ACM"},{"issue":"2","key":"10.1016\/0004-3702(91)90006-6_BIB3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0004-3702(84)90008-0","article-title":"Towards a general theory of action and time","volume":"23","author":"Allen","year":"1984","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability\u2014a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"issue":"2","key":"10.1016\/0004-3702(91)90006-6_BIB5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"4","key":"10.1016\/0004-3702(91)90006-6_BIB6","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1137\/0209063","article-title":"A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality","volume":"9","author":"Aspvall","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(91)90006-6_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","article-title":"Regular algebra applied to path-finding problems","volume":"15","author":"Backhouse","year":"1975","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/0004-3702(91)90006-6_BIB8","article-title":"Use of a longest path algorithm to manage temporal information and restrict search in an automated planner","author":"Bell","year":"1985"},{"key":"10.1016\/0004-3702(91)90006-6_BIB9","author":"Bertel\u00e9","year":"1972"},{"key":"10.1016\/0004-3702(91)90006-6_BIB10","author":"Dantzig","year":"1962"},{"issue":"3","key":"10.1016\/0004-3702(91)90006-6_BIB11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","article-title":"Constraint propagation with interval labels","volume":"32","author":"Davis","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB12","unstructured":"E. Davis, Private communication (1989)."},{"key":"10.1016\/0004-3702(91)90006-6_BIB13","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."},{"issue":"3","key":"10.1016\/0004-3702(91)90006-6_BIB14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB15","series-title":"Proceedings IJCAI-89","first-page":"271","article-title":"Experimental evaluation of preprocessing techniques in constraint satisfaction problems","author":"Dechter","year":"1989"},{"issue":"1","key":"10.1016\/0004-3702(91)90006-6_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint satisfaction problems","volume":"34","author":"Dechter","year":"1987","journal-title":"Artif. Intell."},{"issue":"3","key":"10.1016\/0004-3702(91)90006-6_BIB17","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":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB18","author":"Even","year":"1979"},{"issue":"11","key":"10.1016\/0004-3702(91)90006-6_BIB19","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","article-title":"Synthesizing constraint expressions","volume":"21","author":"Freuder","year":"1978","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/0004-3702(91)90006-6_BIB20","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(91)90006-6_BIB21","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"key":"10.1016\/0004-3702(91)90006-6_BIB22","series-title":"Proceedings AAAI-86","first-page":"328","article-title":"Default reasoning, nonmonotonic logics, and the frame problem","author":"Hanks","year":"1986"},{"key":"10.1016\/0004-3702(91)90006-6_BIB23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0004-3702(77)90015-7","article-title":"Mechanizing temporal knowledge","volume":"9","author":"Kahn","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB25","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0004-3702(91)90006-6_BIB26","article-title":"Metric constraint satisfaction with intervals","author":"Ladkin","year":"1989"},{"key":"10.1016\/0004-3702(91)90006-6_BIB27","article-title":"On binary constraint networks","author":"Ladkin","year":"1989"},{"key":"10.1016\/0004-3702(91)90006-6_BIB28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","article-title":"Algebraic structures for transitive closure","volume":"4","author":"Lehmann","year":"1977","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0004-3702(91)90006-6_BIB29","series-title":"Proceedings 21st Annual Allerton Conference on Communications, Control, and Computing","first-page":"204","article-title":"A mixed-integer linear programming problem which is efficiently solvable","author":"Leiserson","year":"1983"},{"issue":"2","key":"10.1016\/0004-3702(91)90006-6_BIB30","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TCAD.1983.1270022","article-title":"An algorithm to compact a VLSI symbolic layout with mixed constraints","volume":"2","author":"Liao","year":"1983","journal-title":"IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"1","key":"10.1016\/0004-3702(91)90006-6_BIB31","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."},{"issue":"1","key":"10.1016\/0004-3702(91)90006-6_BIB32","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(91)90006-6_BIB33","series-title":"Proceedings IJCAI-83","first-page":"343","article-title":"Reasoning in time and space","author":"Malik","year":"1983"},{"key":"10.1016\/0004-3702(91)90006-6_BIB34","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1207\/s15516709cog0602_1","article-title":"A temporal logic for reasoning about processes and plans","volume":"6","author":"McDermott","year":"1982","journal-title":"Cogn. Sci."},{"key":"10.1016\/0004-3702(91)90006-6_BIB35","article-title":"Faster constraint satisfaction algorithms for temporal reasoning","author":"Meiri","year":"1990"},{"key":"10.1016\/0004-3702(91)90006-6_BIB36","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":"Inf. Sci."},{"key":"10.1016\/0004-3702(91)90006-6_BIB37","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0004-3702(83)80008-3","article-title":"Consistent-labeling problems and their algorithms: expected-complexities and theory-based heuristics","volume":"21","author":"Nudel","year":"1983","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB38","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0004-3702(91)90006-6_BIB39","article-title":"Partial order programming","author":"Parker","year":"1987"},{"key":"10.1016\/0004-3702(91)90006-6_BIB40","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","article-title":"Search rearrangement backtracking and polynomial average time","volume":"21","author":"Purdom","year":"1983","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(91)90006-6_BIB41","author":"Shoham","year":"1988"},{"issue":"4","key":"10.1016\/0004-3702(91)90006-6_BIB42","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1145\/322276.322288","article-title":"Deciding linear inequalities by computing loop residues","volume":"28","author":"Shostak","year":"1981","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0004-3702(91)90006-6_BIB43","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/322261.322272","article-title":"A unified approach to path problems","volume":"28","author":"Tarjan","year":"1981","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0004-3702(91)90006-6_BIB44","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/322261.322273","article-title":"Fast algorithms for solving path problems","volume":"28","author":"Tarjan","year":"1981","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0004-3702(91)90006-6_BIB45","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(91)90006-6_BIB46","article-title":"Spatio-temporal reasoning and linear inequalities","author":"Vald\u00e9s-P\u00e9rez","year":"1986"},{"key":"10.1016\/0004-3702(91)90006-6_BIB47","series-title":"Proceedings IJCAI-89","first-page":"1291","article-title":"Approximation algorithms for temporal reasoning","author":"Van Beek","year":"1989"},{"key":"10.1016\/0004-3702(91)90006-6_BIB48","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(91)90006-6_BIB49","series-title":"Proceedings AAAI-86","first-page":"377","article-title":"Constraint propagation algorithms for temporal reasoning","author":"Vilain","year":"1986"},{"key":"10.1016\/0004-3702(91)90006-6_BIB50","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner trees, partial 2-trees, and minimum IFI networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370291900066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370291900066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T20:26:42Z","timestamp":1553632002000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370291900066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":50,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0004370291900066"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(91)90006-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}