{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:11:17Z","timestamp":1778296277525,"version":"3.51.4"},"reference-count":41,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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,10]]},"DOI":"10.1016\/0004-3702(94)90104-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"73-117","source":"Crossref","is-referenced-by-count":73,"title":["Exploiting the deep structure of constraint problems"],"prefix":"10.1016","volume":"70","author":[{"given":"Colin P.","family":"Williams","sequence":"first","affiliation":[]},{"given":"Tad","family":"Hogg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)90104-X_BIB1","author":"Bender","year":"1978"},{"key":"10.1016\/0004-3702(94)90104-X_BIB2","author":"Bollobas","year":"1985"},{"key":"10.1016\/0004-3702(94)90104-X_BIB3","author":"Bollobas","year":"1986"},{"key":"10.1016\/0004-3702(94)90104-X_BIB4","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/0004-3702(94)90104-X_BIB5","series-title":"Proceedings Physics of Computation Workshop","article-title":"Computational complexity and phase transitions","author":"Cheeseman","year":"1992"},{"key":"10.1016\/0004-3702(94)90104-X_BIB6","series-title":"Computation: The Micro and the Macro View","first-page":"33","article-title":"Cooperative problem solving","author":"Clearwater","year":"1992"},{"issue":"3","key":"10.1016\/0004-3702(94)90104-X_BIB7","first-page":"33","article-title":"Trial by fire: understanding the design requirements for agents in complex environments","volume":"10","author":"Cohen","year":"1989","journal-title":"AI Mag."},{"key":"10.1016\/0004-3702(94)90104-X_BIB8","series-title":"AAAI Spring Symposium on AI and NP-Hard Problems","first-page":"22","article-title":"Experimental results on the cross-over point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(94)90104-X_BIB9","series-title":"Proceedings AAAI-86","first-page":"178","article-title":"Learning while searching in constraint-satisfaction problems","author":"Dechter","year":"1986"},{"key":"10.1016\/0004-3702(94)90104-X_BIB10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","article-title":"An assumption-based TMS","volume":"28","author":"de Kleer","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90104-X_BIB11","series-title":"Proceedings IJCAI-89","article-title":"A comparison of ATMS and CSP techniques","author":"de Kleer","year":"1989"},{"key":"10.1016\/0004-3702(94)90104-X_BIB12","series-title":"Proceedings IJCAI-89","first-page":"341","article-title":"Conspiracy numbers and caching for searching and\/or trees and theorem proving","author":"Elkan","year":"1989"},{"key":"10.1016\/0004-3702(94)90104-X_BIB13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0004-3702(94)90104-X_BIB14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","article-title":"Partial constraint satisfaction","volume":"58","author":"Freuder","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90104-X_BIB15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-8655(91)90032-H","article-title":"A cluster detection algorithm based on percolation theory","volume":"12","author":"Gotsman","year":"1991","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0004-3702(94)90104-X_BIB16","series-title":"Proceedings AAAI-92","first-page":"117","article-title":"Polynomial-time learning with version spaces","author":"Hirsh","year":"1992"},{"issue":"4","key":"10.1016\/0004-3702(94)90104-X_BIB17","first-page":"223","article-title":"Phase transitions in high-dimensional pattern classification","volume":"5","author":"Hogg","year":"1990","journal-title":"Comput. Syst. Sci. Eng."},{"key":"10.1016\/0004-3702(94)90104-X_BIB18","series-title":"Proceedings AAAI-93","first-page":"231","article-title":"Solving the really hard problems with cooperative search","author":"Hogg","year":"1993"},{"key":"10.1016\/0004-3702(94)90104-X_BIB19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","article-title":"Phase transitions in artificial intelligence systems","volume":"33","author":"Huberman","year":"1987","journal-title":"Artif. Intell."},{"issue":"3","key":"10.1016\/0004-3702(94)90104-X_BIB20","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(94)90104-X_BIB21","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0004-3702(94)90104-X_BIB22","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"6","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"10.1016\/0004-3702(94)90104-X_BIB23","series-title":"Proceedings AAAI-88","first-page":"564","article-title":"Quantitative results concerning the utility of explanation-based learning","author":"Minton","year":"1988"},{"key":"10.1016\/0004-3702(94)90104-X_BIB24","series-title":"Proceedings AAAI-90","first-page":"17","article-title":"Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method","author":"Minton","year":"1990"},{"key":"10.1016\/0004-3702(94)90104-X_BIB25","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems","volume":"58","author":"Minton","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90104-X_BIB26","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0004-3702(94)90104-X_BIB27","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","article-title":"Generalization as search","volume":"18","author":"Mitchell","year":"1982","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90104-X_BIB28","series-title":"Proceedings AAAI-92","first-page":"428","article-title":"On the density of solutions in equilibrium points for the queens problem","author":"Morris","year":"1992"},{"key":"10.1016\/0004-3702(94)90104-X_BIB29","series-title":"Proceedings AAAI-92","first-page":"466","article-title":"How long will it take?","author":"Musick","year":"1992"},{"key":"10.1016\/0004-3702(94)90104-X_BIB30","series-title":"Proceedings 32nd Annual Symposium on Foundations of Computer Science","first-page":"163","article-title":"On selecting a satisfying truth assignment","author":"Papadimitriou","year":"1991"},{"key":"10.1016\/0004-3702(94)90104-X_BIB31","author":"Papoulis","year":"1990"},{"key":"10.1016\/0004-3702(94)90104-X_BIB32","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(94)90104-X_BIB33","article-title":"Efficiency analysis of multiple-context TMSs in scene representation","author":"Provan","year":"1987"},{"key":"10.1016\/0004-3702(94)90104-X_BIB34","series-title":"Proceedings AAAI-87","first-page":"173","article-title":"Efficiency analysis of multiple-context TMSs in scene representation","author":"Provan","year":"1987"},{"key":"10.1016\/0004-3702(94)90104-X_BIB35","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(94)90104-X_BIB36","series-title":"Proceedings AAAI-92","first-page":"117","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/0004-3702(94)90104-X_BIB37","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1126\/science.236.4805.1092","article-title":"Observation of phase transitions in spreading activation networks","volume":"236","author":"Shrager","year":"1987","journal-title":"Science"},{"key":"10.1016\/0004-3702(94)90104-X_BIB38","author":"Touretzky","year":"1986"},{"key":"10.1016\/0004-3702(94)90104-X_BIB39","first-page":"1239","article-title":"Phase transitions in sequence matches and nucleic acid structure","volume":"84","author":"Waterman","year":"1987"},{"key":"10.1016\/0004-3702(94)90104-X_BIB40","series-title":"Proceedings AAAI-92","first-page":"472","article-title":"Using deep structure to locate hard problems","author":"Williams","year":"1992"},{"issue":"3","key":"10.1016\/0004-3702(94)90104-X_BIB41","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1111\/j.1467-8640.1993.tb00307.x","article-title":"The typicality of phase transitions in search","volume":"9","author":"Williams","year":"1993","journal-title":"Comput. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029490104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029490104X?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:56:54Z","timestamp":1553633814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029490104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["000437029490104X"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90104-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}