{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T09:24:09Z","timestamp":1774257849593,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":[[1993,2]]},"DOI":"10.1016\/0004-3702(93)90170-g","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"57-62","source":"Crossref","is-referenced-by-count":31,"title":["The complexity of constraint satisfaction revisited"],"prefix":"10.1016","volume":"59","author":[{"given":"Alan K.","family":"Mackworth","sequence":"first","affiliation":[]},{"given":"Eugene C.","family":"Freuder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(93)90170-G_BIB1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0004-3702(71)90005-1","article-title":"On seeing things","volume":"2","author":"Clowes","year":"1971","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90170-G_BIB2","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(93)90170-G_BIB3","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":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90170-G_BIB4","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(93)90170-G_BIB5","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(93)90170-G_BIB6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","article-title":"REF-ARF: a system for solving problems stated as procedures","volume":"1","author":"Fikes","year":"1970","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90170-G_BIB7","series-title":"Proceedings AAAI-90","first-page":"4","article-title":"Complexity of k-tree structured constraint satisfaction problems","author":"Freuder","year":"1990"},{"key":"10.1016\/0004-3702(93)90170-G_BIB8","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"key":"10.1016\/0004-3702(93)90170-G_BIB9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","article-title":"On the parallel complexity of discrete relaxation in constraint satisfaction networks","volume":"45","author":"Kasif","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90170-G_BIB10","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(93)90170-G_BIB11","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(93)90170-G_BIB12","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1111\/j.1467-8640.1985.tb00064.x","article-title":"Hierarchical arc consistency: exploiting structured domains in constraint satisfaction problems","volume":"1","author":"Mackworth","year":"1985","journal-title":"Comput. Intell."},{"key":"10.1016\/0004-3702(93)90170-G_BIB13","series-title":"Proceedings AAAI-91","first-page":"260","article-title":"Combining qualitative and quantitative constraints in temporal reasoning","author":"Meiri","year":"1991"},{"key":"10.1016\/0004-3702(93)90170-G_BIB14","series-title":"Proceedings AAAI-90","first-page":"10","article-title":"Tree decomposition with applications to constraint processing","author":"Meiri","year":"1990"},{"key":"10.1016\/0004-3702(93)90170-G_BIB15","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(93)90170-G_BIB16","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(93)90170-G_BIB17","doi-asserted-by":"crossref","unstructured":"M. Perlin, Arc consistency for factorable relations, Artif. Intell. (to appear).","DOI":"10.1109\/TAI.1991.167113"},{"key":"10.1016\/0004-3702(93)90170-G_BIB18","series-title":"Proceedings IJCAI-81","first-page":"338","article-title":"A new method for solving constraint satisfaction problems","author":"Seidel","year":"1981"},{"key":"10.1016\/0004-3702(93)90170-G_BIB19","series-title":"Proceedings AAAI-90","first-page":"693","article-title":"A framework for investigating production system formulations with polynomially bounded match","author":"Tambe","year":"1990"},{"key":"10.1016\/0004-3702(93)90170-G_BIB20","author":"Van Hentenryck","year":"1989"},{"key":"10.1016\/0004-3702(93)90170-G_BIB21","series-title":"The Psychology of Computer Vision","first-page":"19","article-title":"Understanding line drawings of scenes with shadows","author":"Waltz","year":"1975"},{"key":"10.1016\/0004-3702(93)90170-G_BIB22","series-title":"Proceedings 3rd IEEE Symposium on Parallel and Distributed Processing","first-page":"394","article-title":"Parallel and distributed algorithms for finite constraint satisfaction problems","author":"Zhang","year":"1991"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029390170G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029390170G?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:52:21Z","timestamp":1553647941000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029390170G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["000437029390170G"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(93)90170-g","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}