{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:14Z","timestamp":1774946534907,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5564,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0004-3702(98)00022-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"251-265","source":"Crossref","is-referenced-by-count":142,"title":["Constraints, consistency and closure"],"prefix":"10.1016","volume":"101","author":[{"given":"Peter","family":"Jeavons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin C.","family":"Cooper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00022-8_bib1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01187059","article-title":"Polynomial interpolation and the Chinese remainder theorem","volume":"143","author":"Baker","year":"1975","journal-title":"Math. Z."},{"issue":"6","key":"10.1016\/S0004-3702(98)00022-8_bib2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relation model of data for large shared databanks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(98)00022-8_bib3","series-title":"Proceedings 2nd International Conference on Constraint Programming\u2014CP'96","first-page":"134","article-title":"Derivation of constraints and database relation","volume":"Vol. 1118","author":"Cohen","year":"1996"},{"key":"10.1016\/S0004-3702(98)00022-8_bib4","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"},{"key":"10.1016\/S0004-3702(98)00022-8_bib5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(94)90021-3","article-title":"Characterising tractable constraints","volume":"65","author":"Cooper","year":"1994","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(98)00022-8_bib6","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"},{"key":"10.1016\/S0004-3702(98)00022-8_bib7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(98)00022-8_bib8","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00022-8_bib9","series-title":"Proceedings IJCAI' 97","first-page":"405","article-title":"Constraint satisfaction over connected row convex constraints","author":"Deville","year":"1997"},{"key":"10.1016\/S0004-3702(98)00022-8_bib10","series-title":"Proceedings 25th ACM Symposium on the Theory of Computing (STOC)","first-page":"612","article-title":"Monotone monadic SNP and constraint satisfaction","author":"Feder","year":"1993"},{"issue":"1","key":"10.1016\/S0004-3702(98)00022-8_bib11","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\/S0004-3702(98)00022-8_bib12","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","article-title":"A sufficient condition for backtrack-bounded search","volume":"32","author":"Freuder","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(98)00022-8_bib13","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/S0004-3702(98)00022-8_bib14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(94)90003-5","article-title":"Decomposing constraint satisfaction problems using database techniques","volume":"66","author":"Gyssens","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00022-8_bib15","series-title":"Computing and Combinatorics. First International Conference COCOON'95","article-title":"An algebraic characterization of tractable constraints","volume":"Vol. 959","author":"Jeavons","year":"1995"},{"key":"10.1016\/S0004-3702(98)00022-8_bib16","series-title":"Proceedings 1st International Conference on Constraint Programming\u2014CP'95","article-title":"A unifying framework for tractable constraints","volume":"Vol. 976","author":"Jeavons","year":"1995"},{"key":"10.1016\/S0004-3702(98)00022-8_bib17","series-title":"Proceedings 2nd International Conference on Constraint Programming\u2014CP'96","first-page":"267","article-title":"A test for tractability","volume":"Vol. 1118","author":"Jeavons","year":"1996"},{"key":"10.1016\/S0004-3702(98)00022-8_bib18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/263867.263489","article-title":"Closure properties of constraints","volume":"44","author":"Jeavons","year":"1997","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0004-3702(98)00022-8_bib19","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"},{"key":"10.1016\/S0004-3702(98)00022-8_bib20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0004-3702(93)90063-H","article-title":"Fast parallel constraint satisfaction","volume":"64","author":"Kirousis","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00022-8_bib21","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/176584.176585","article-title":"On binary constraint problems","volume":"41","author":"Ladkin","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(98)00022-8_bib22","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00022-8_bib23","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":"Inform. Sci."},{"key":"10.1016\/S0004-3702(98)00022-8_bib24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0004-3702(91)90059-S","article-title":"Constraint relaxation may be perfect","volume":"48","author":"Montanari","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00022-8_bib25","series-title":"Proceedings 10th ACM Symposium on Theory of Computing (STOC)","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0004-3702(98)00022-8_bib26","article-title":"Clones in Universal Algebra","volume":"Vol. 99","author":"Szendrei","year":"1986"},{"key":"10.1016\/S0004-3702(98)00022-8_bib27","series-title":"Proceedings AAAI-92","first-page":"447","article-title":"On the minimality and decomposability of row-convex constraint networks","author":"van Beek","year":"1992"},{"key":"10.1016\/S0004-3702(98)00022-8_bib28","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/210346.210347","article-title":"On the minimality and decomposability of row-convex constraint networks","volume":"42","author":"van Beek","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(98)00022-8_bib29","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/263867.263499","article-title":"Constraint tightness and looseness versus local and global consistency","volume":"44","author":"van Beek","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(98)00022-8_bib30","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","article-title":"A generic arc-consistency algorithm and its specializations","volume":"57","author":"van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000228?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000228?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:50:19Z","timestamp":1555051819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298000228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0004370298000228"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00022-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}