{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:39:02Z","timestamp":1777635542859,"version":"3.51.4"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0020-0190(98)00023-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"41-48","source":"Crossref","is-referenced-by-count":2,"title":["Revisiting global constraint satisfaction"],"prefix":"10.1016","volume":"66","author":[{"given":"Walter","family":"Hower","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(98)00023-4_BIB1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0004-3702(88)90023-9","article-title":"Constraint satisfaction from a deductive viewpoint","volume":"35","author":"Bibel","year":"1988","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0020-0190(98)00023-4_BIB2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0210043","article-title":"An average time analysis of backtracking","volume":"10","author":"Brown","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(89)90080-5","article-title":"An optimal k-consistency algorithm","volume":"41","author":"Cooper","year":"1989","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0004-3702(92)90043-W","article-title":"From local to global consistency","volume":"55","author":"Dechter","year":"1992","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0304-3975(97)86737-0","article-title":"Local and global relational consistency","volume":"173","author":"Dechter","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"10.1016\/S0020-0190(98)00023-4_BIB6","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":"Comm. ACM"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB7","first-page":"2027","article-title":"Systematic versus stochastic constraint satisfaction","volume":"Vol. 2","author":"Freuder","year":"1995"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(98)00023-4_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF00143878","article-title":"Constraint query algebras","volume":"1","author":"Goldin","year":"1996","journal-title":"Constraints"},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s007780050016","article-title":"Join algorithm costs revisited","volume":"5","author":"Harris","year":"1996","journal-title":"VLDB J."},{"issue":"3","key":"10.1016\/S0020-0190(98)00023-4_BIB10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(95)00089-U","article-title":"Constraint satisfaction\u2014Algorithms and complexity analysis","volume":"55","author":"Hower","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB11","first-page":"57","article-title":"Bottom-up layout generation","volume":"20","author":"Hower","year":"1996","journal-title":"Informatica"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB12","article-title":"Global constraint satisfaction revisited","author":"Hower","year":"1997"},{"issue":"7","key":"10.1016\/S0020-0190(98)00023-4_BIB13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0950-7051(96)01055-6","article-title":"A bibliographical survey of constraintbased approaches to CAD, graphics, layout, visualization, and related topics","volume":"9","author":"Hower","year":"1996","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/095281398146897","article-title":"Fine-grained conflict resolution in constraint satisfaction problems","volume":"10","author":"Hower","year":"1998","journal-title":"J. Experiment. Theoret. Artif. Intell."},{"issue":"2","key":"10.1016\/S0020-0190(98)00023-4_BIB15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","article-title":"Tractable constraints on ordered domains","volume":"79","author":"Jeavons","year":"1995","journal-title":"Artificial Intelligence"},{"issue":"129","key":"10.1016\/S0020-0190(98)00023-4_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","article-title":"Estimating the efficiency of backtrack programs","volume":"29","author":"Knuth","year":"1975","journal-title":"Math. Comput."},{"issue":"3\u20134","key":"10.1016\/S0020-0190(98)00023-4_BIB17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(93)90047-K","article-title":"Generalized constraint propagation over the CLP scheme","volume":"16","author":"Le Provost","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB18","first-page":"285","article-title":"Constraint satisfaction","volume":"Vol. 1","author":"Mackworth","year":"1992"},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/256292.256296","article-title":"Avoiding Cartesian products for multiple joins","volume":"44","author":"Morishita","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB20","article-title":"Consistent labeling methods using constraint networks","author":"Nishihara","year":"1985"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB21","unstructured":"also in: Systems Comput. Japan 16 (1)."},{"key":"10.1016\/S0020-0190(98)00023-4_BIB22","series-title":"ECAI-94, 11th European Conference on Artificial Intelligence","first-page":"125","article-title":"Contradicting conventional wisdom in constraint satisfaction","author":"Sabin","year":"1994"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB23","first-page":"338","article-title":"A new method for solving constraint satisfaction problems","volume":"Vol. 1","author":"Seidel","year":"1981"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB24","article-title":"On the complexity of achieving k-consistency","author":"Seidel","year":"1983"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB25","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","article-title":"Ein Satz \u00fcber Untermengen einer endlichen Menge","volume":"27","author":"Sperner","year":"1928","journal-title":"Math. Z."},{"key":"10.1016\/S0020-0190(98)00023-4_BIB26","series-title":"Computation in Cognitive Science","article-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S0020-0190(98)00023-4_BIB27","series-title":"Proc. AAAI-94","article-title":"On the inherent level of local consistency in constraint networks","author":"van Beek","year":"1994"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(98)00023-4_BIB28","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","volume":"70","author":"Williams","year":"1994","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0020-0190(98)00023-4_BIB29","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/09528139650042547","article-title":"Backtracking along with constraint processing and their time complexities","volume":"8","author":"Zahn","year":"1996","journal-title":"J. Experiment. Theoret. Artif. Intell."},{"key":"10.1016\/S0020-0190(98)00023-4_BIB30","series-title":"Principles and Practice of Constraint Programming: The Newport Papers","first-page":"51","article-title":"Constraint programming in constraint nets","author":"Zhang","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:53:50Z","timestamp":1555944830000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0020019098000234"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00023-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}