{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:31:59Z","timestamp":1752460319188},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":[[1994,8]]},"DOI":"10.1016\/0004-3702(94)90068-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"211-241","source":"Crossref","is-referenced-by-count":59,"title":["Experimental evaluation of preprocessing algorithms for constraint satisfaction problems"],"prefix":"10.1016","volume":"68","author":[{"given":"Rina","family":"Dechter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itay","family":"Meiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0004-3702(94)90068-X_BIB1","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"},{"key":"10.1016\/0004-3702(94)90068-X_BIB2","series-title":"Proceedings IJCAI-91","first-page":"318","article-title":"On the feasibility of distributed constraint satisfaction","author":"Collin","year":"1991"},{"issue":"3","key":"10.1016\/0004-3702(94)90068-X_BIB3","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(94)90068-X_BIB4","series-title":"Encyclopedia of Artificial Intelligence","first-page":"276","article-title":"Constraint networks","author":"Dechter","year":"1992"},{"key":"10.1016\/0004-3702(94)90068-X_BIB5","series-title":"Combining GSAT and path consistency for solving constraint satisfaction problems, 94-17","author":"Dechter","year":"1994"},{"issue":"1","key":"10.1016\/0004-3702(94)90068-X_BIB6","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."},{"key":"10.1016\/0004-3702(94)90068-X_BIB7","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(94)90068-X_BIB8","author":"Even","year":"1979"},{"issue":"11","key":"10.1016\/0004-3702(94)90068-X_BIB9","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","article-title":"Synthesizing constraint expression","volume":"21","author":"Freuder","year":"1978","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/0004-3702(94)90068-X_BIB10","doi-asserted-by":"crossref","first-page":"24","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\/0004-3702(94)90068-X_BIB11","series-title":"Proceedings AAAI-94","article-title":"Dead-end driven learning","author":"Frost","year":"1994"},{"key":"10.1016\/0004-3702(94)90068-X_BIB12","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"key":"10.1016\/0004-3702(94)90068-X_BIB13","series-title":"Proceedings AAAI-90","first-page":"210","article-title":"Search lesson learned from crossword puzzles","author":"Ginsberg","year":"1990"},{"issue":"3","key":"10.1016\/0004-3702(94)90068-X_BIB14","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(94)90068-X_BIB15","series-title":"Encyclopedia of Artificial Intelligence","first-page":"285","article-title":"Constraint satisfaction","author":"Mackworth","year":"1992"},{"issue":"1","key":"10.1016\/0004-3702(94)90068-X_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(94)90068-X_BIB17","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"issue":"2","key":"10.1016\/0004-3702(94)90068-X_BIB18","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."},{"issue":"1\u20132","key":"10.1016\/0004-3702(94)90068-X_BIB19","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."},{"issue":"3","key":"10.1016\/0004-3702(94)90068-X_BIB20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid algorithms for the constraint satisfaction problem","volume":"9","author":"Prosser","year":"1993","journal-title":"Comput. Intell."},{"issue":"1\u20132","key":"10.1016\/0004-3702(94)90068-X_BIB21","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."},{"issue":"2","key":"10.1016\/0004-3702(94)90068-X_BIB22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00288958","article-title":"Backtracking with multi-level dynamic search rearrangement","volume":"15","author":"Purdom","year":"1981","journal-title":"Acta. Inf."},{"key":"10.1016\/0004-3702(94)90068-X_BIB23","article-title":"Empirical study of some constraint satisfaction algorithms","author":"Rosiers","year":"1986"},{"key":"10.1016\/0004-3702(94)90068-X_BIB24","article-title":"Variable and value ordering heuristics for hard constraint satisfaction problems: an application to job shop scheduling","author":"Sadeh","year":"1992"},{"issue":"2","key":"10.1016\/0004-3702(94)90068-X_BIB25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","article-title":"Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis","volume":"9","author":"Stallman","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90068-X_BIB26","article-title":"Efficient search techniques\u2014an empirical study of the N-Queens problem","author":"Stone","year":"1986"},{"key":"10.1016\/0004-3702(94)90068-X_BIB27","series-title":"Proceedings Fourth International Conference on Logic Programming","first-page":"229","article-title":"Forward checking in logic programming","author":"Van Hentenryck","year":"1987"},{"key":"10.1016\/0004-3702(94)90068-X_BIB28","series-title":"The Psychology of Computer Vision","article-title":"Understanding line drawings of scenes with shadows","author":"Waltz","year":"1975"},{"key":"10.1016\/0004-3702(94)90068-X_BIB29","series-title":"Proceedings AAAI-88","first-page":"155","article-title":"A rearrangement search strategy for determining propositional satisfiability","author":"Zabih","year":"1988"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029490068X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029490068X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:56:17Z","timestamp":1553648177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029490068X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["000437029490068X"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90068-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}