{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T12:54:00Z","timestamp":1783515240911,"version":"3.55.0"},"reference-count":126,"publisher":"Elsevier","isbn-type":[{"value":"9780444527264","type":"print"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1574-6526(06)80007-6","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T16:51:39Z","timestamp":1204044699000},"page":"29-83","source":"Crossref","is-referenced-by-count":122,"title":["Constraint Propagation"],"prefix":"10.1016","member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80007-6_bib1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","article-title":"The essence of constraint propagation","volume":"221","author":"Apt","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1574-6526(06)80007-6_bib2","series-title":"Principles of Constraint Programming","author":"Apt","year":"2003"},{"key":"10.1016\/S1574-6526(06)80007-6_bib3","series-title":"Proceedings CP'99","first-page":"58","article-title":"Automatic generation of constraint propagation algorithms for small finite domains","author":"Apt","year":"1999"},{"key":"10.1016\/S1574-6526(06)80007-6_bib4","series-title":"Proceedings IJCAI'05","first-page":"35","article-title":"Propagating logical combinations of constraints","author":"Bacchus","year":"2005"},{"key":"10.1016\/S1574-6526(06)80007-6_bib5","series-title":"Proceedings of CP'00 Workshop on Techniques for Implementing Constraint Programming Systems (TRICS)","first-page":"30","article-title":"A general relation constraint: An implementation","author":"Bart\u00e1k","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib6","series-title":"Proceedings FLAIRS'04","article-title":"A new algorithm for singleton arc consistency","author":"Bart\u00e1k","year":"2004"},{"key":"10.1016\/S1574-6526(06)80007-6_bib7","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1574-6526(06)80007-6_bib8","series-title":"Proceedings CP'01","first-page":"211","article-title":"Pruning for the minimum constraint family and for the number of distinct values constraint family","author":"Beldiceanu","year":"2001"},{"key":"10.1016\/S1574-6526(06)80007-6_bib9","article-title":"Global constraint catalog","author":"Beldiceanu","year":"2005"},{"key":"10.1016\/S1574-6526(06)80007-6_bib10","series-title":"Proceedings of the International Symposium on Logic Programming (ILPS'94)","first-page":"124","article-title":"Clp(intervals) revisited","author":"Benhamou","year":"1994"},{"key":"10.1016\/S1574-6526(06)80007-6_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","article-title":"Applying interval arithmetic to real, integer and boolean constraints","volume":"32","author":"Benhamou","year":"1997","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1574-6526(06)80007-6_bib12","series-title":"Proceedings CP'01","first-page":"560","article-title":"Partition-k-ac: an efficient filtering technique combining domain partition and arc consistency","author":"Bennaceur","year":"2001"},{"key":"10.1016\/S1574-6526(06)80007-6_bib13","series-title":"Proceedings IEEE Conference on Artificial Intelligence and Applications (CAIA'95)","article-title":"Improving domain filtering using restricted path consistency","author":"Berlandier","year":"1995"},{"key":"10.1016\/S1574-6526(06)80007-6_bib14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(94)90041-8","article-title":"Arc-consistency and arc-consistency again","volume":"65","author":"Bessiere","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib15","series-title":"Proceedings AAAI'93","first-page":"108","article-title":"Arc-consistency and arc-consistency again","author":"Bessiere","year":"1993"},{"key":"10.1016\/S1574-6526(06)80007-6_bib16","series-title":"Proceedings ECAI'04 Workshop on Modelling and solving problems with constraints","first-page":"20","article-title":"Theoretical analysis of singleton arc consistency","author":"Bessiere","year":"2004"},{"key":"10.1016\/S1574-6526(06)80007-6_bib17","series-title":"Proceedings IJCAI'05","first-page":"54","article-title":"Optimal and suboptimal singleton arc consistency algorithms","author":"Bessiere","year":"2005"},{"key":"10.1016\/S1574-6526(06)80007-6_bib18","series-title":"Proceedings IJCAI'95","first-page":"592","article-title":"Using inference to reduce arc consistency computation","author":"Bessiere","year":"1995"},{"key":"10.1016\/S1574-6526(06)80007-6_bib19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0004-3702(98)00105-2","article-title":"Using constraint metaknowledge to reduce arc consistency computation","volume":"107","author":"Bessiere","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib20","series-title":"Proceedings AAAI'04","first-page":"112","article-title":"The complexity of global constraints","author":"Bessiere","year":"2004"},{"key":"10.1016\/S1574-6526(06)80007-6_bib21","series-title":"Proceedings CP'04","first-page":"716","article-title":"The tractability of global constraints","author":"Bessiere","year":"2004"},{"key":"10.1016\/S1574-6526(06)80007-6_bib22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0004-3702(02)00263-1","article-title":"On forward checking for non-binary constraint satisfaction","volume":"141","author":"Bessiere","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib23","series-title":"Proceedings IJCAI'97","first-page":"398","article-title":"Arc consistency for general constraint networks: preliminary results","author":"Bessiere","year":"1997"},{"key":"10.1016\/S1574-6526(06)80007-6_bib24","series-title":"Proceedings IJCAI'01","first-page":"309","article-title":"Refining the basic constraint propagation algorithm","author":"Bessiere","year":"2001"},{"key":"10.1016\/S1574-6526(06)80007-6_bib25","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","article-title":"An optimal coarse-grained arc consistency algorithm","volume":"165","author":"Bessiere","year":"2005","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib26","series-title":"Proceedings CP'03","first-page":"789","article-title":"To be or not to be \u2026 a global constraint","author":"Bessiere","year":"2003"},{"issue":"4","key":"10.1016\/S1574-6526(06)80007-6_bib27","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/357146.357147","article-title":"The programming language aspects of thinglab, a constraint-oriented simulation laboratory","volume":"3","author":"Borning","year":"1981","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/S1574-6526(06)80007-6_bib28","series-title":"Proceedings of the CP'04 Workshop on Constraint Propagation and Implementation","first-page":"29","article-title":"Revision ordering heuristics for the constraint satisfaction problem","author":"Boussemart","year":"2004"},{"issue":"3\u20134","key":"10.1016\/S1574-6526(06)80007-6_bib29","first-page":"137","article-title":"A survey on knowledge compilation","volume":"10","author":"Cadoli","year":"1997","journal-title":"AI Communications"},{"key":"10.1016\/S1574-6526(06)80007-6_bib30","series-title":"Proceedings CP'03","first-page":"214","article-title":"Box constraint collections for adhoc constraints","author":"Cheng","year":"2003"},{"key":"10.1016\/S1574-6526(06)80007-6_bib31","series-title":"Proceedings AAAI'96","first-page":"196","article-title":"Path-consistency: when space misses time","author":"Chmeiss","year":"1996"},{"key":"10.1016\/S1574-6526(06)80007-6_bib32","series-title":"Proceedings RFIA'96","first-page":"212","article-title":"Sur la consistance de chemin et ses formes partielles","author":"Chmeiss","year":"1996"},{"issue":"2","key":"10.1016\/S1574-6526(06)80007-6_bib33","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1142\/S0218213098000081","article-title":"Efficient path-consistency propagation","volume":"7","author":"Chmeiss","year":"1998","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"10.1016\/S1574-6526(06)80007-6_bib34","series-title":"Proceedings IEEE-ICTAI'00","first-page":"104","article-title":"About the use of local consistency in solving CSPs","author":"Chmeiss","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib35","series-title":"Finite domain bounds consistency revisited","author":"Choi","year":"2004"},{"key":"10.1016\/S1574-6526(06)80007-6_bib36","series-title":"Proceedings CP'98","first-page":"147","article-title":"A note on partial consistencies over continuous domains","author":"Collavizza","year":"1998"},{"key":"10.1016\/S1574-6526(06)80007-6_bib37","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\/S1574-6526(06)80007-6_bib38","article-title":"Compilation et apprentissage dans les r\u00e9seaux de contraintes","author":"Cros","year":"2003","journal-title":"PhD thesis, University Montpellier II, France"},{"key":"10.1016\/S1574-6526(06)80007-6_bib39","series-title":"Proceedings CP'02","first-page":"541","article-title":"Indexical-based solver learning","author":"Dao","year":"2002"},{"key":"10.1016\/S1574-6526(06)80007-6_bib40","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1574-6526(06)80007-6_bib41","series-title":"Proceedings ECAI'00","first-page":"88","article-title":"A property of path inverse consistency leading to an optimal pic algorithm","author":"Debruyne","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib42","series-title":"Proceedings CP'97","first-page":"312","article-title":"From restricted path consistency to max-restricted path consistency","author":"Debruyne","year":"1997"},{"key":"10.1016\/S1574-6526(06)80007-6_bib43","series-title":"Proceedings IJCAI'97","first-page":"412","article-title":"Some practicable filtering techniques for the constraint satisfaction problem","author":"Debruyne","year":"1997"},{"key":"10.1016\/S1574-6526(06)80007-6_bib44","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","article-title":"Domain filtering consistencies","volume":"14","author":"Debruyne","year":"2001","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S1574-6526(06)80007-6_bib45","series-title":"Proceedings AAAI'90","first-page":"556","article-title":"On the expressiveness of networks with hidden variables","author":"Dechter","year":"1990"},{"key":"10.1016\/S1574-6526(06)80007-6_bib46","series-title":"Constraint Processing","author":"Dechter","year":"2003"},{"key":"10.1016\/S1574-6526(06)80007-6_bib47","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\/S1574-6526(06)80007-6_bib48","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":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1574-6526(06)80007-6_bib49","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":"Theoretical Computer Science"},{"key":"10.1016\/S1574-6526(06)80007-6_bib50","series-title":"Proceedings of the International Conference on Fifth Generation Computer Systems","first-page":"693","article-title":"The constraint logic programming language chip","author":"Dincbas","year":"1988"},{"key":"10.1016\/S1574-6526(06)80007-6_bib51","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":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib52","article-title":"Improvements to propositional satisfiability search algorithms","author":"Freeman","year":"1995","journal-title":"PhD thesis, University of Pennsylvania, Philadelphia PA"},{"issue":"11","key":"10.1016\/S1574-6526(06)80007-6_bib53","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":"Communications of the ACM"},{"issue":"1","key":"10.1016\/S1574-6526(06)80007-6_bib54","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":"Journal of the ACM"},{"issue":"4","key":"10.1016\/S1574-6526(06)80007-6_bib55","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":"Journal of the ACM"},{"key":"10.1016\/S1574-6526(06)80007-6_bib56","series-title":"Proceedings KR'91","first-page":"186","article-title":"Completable representations of constraint satisfaction problems","author":"Freuder","year":"1991"},{"key":"10.1016\/S1574-6526(06)80007-6_bib57","series-title":"Proceedings AAAI'96","first-page":"202","article-title":"Neighborhood inverse consistency preprocessing","author":"Freuder","year":"1996"},{"key":"10.1016\/S1574-6526(06)80007-6_bib58","series-title":"IEEE-ICTAI'91","first-page":"332","article-title":"Selective relaxation for constraint satisfaction problems","author":"Freuder","year":"1991"},{"issue":"1\u20133","key":"10.1016\/S1574-6526(06)80007-6_bib59","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","article-title":"Theory and practice of constraint handling rules","volume":"37","author":"Fr\u00fchwirth","year":"1998","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1574-6526(06)80007-6_bib60","series-title":"Computers and Intractability: A Guide to NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S1574-6526(06)80007-6_bib61","series-title":"Proceedings Twelfth Annual Allerton Conference on Circuit and System Theory","first-page":"866","article-title":"A constraint satisfaction method for inference making","author":"Gaschnig","year":"1974"},{"key":"10.1016\/S1574-6526(06)80007-6_bib62","series-title":"Proceedings CCSCSI'78","first-page":"268","article-title":"Experimental case studies of backtrack vs waltz-type vs new algorithms for satisficing assignment problems","author":"Gaschnig","year":"1978"},{"key":"10.1016\/S1574-6526(06)80007-6_bib63","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0004-3702(00)00051-5","article-title":"Decomposable constraints","volume":"123","author":"Gent","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib64","series-title":"Proceedings CP'97","first-page":"327","article-title":"The constrainedness of arc consistency","author":"Gent","year":"1997"},{"key":"10.1016\/S1574-6526(06)80007-6_bib65","series-title":"Proceedings AAAI'96","first-page":"246","article-title":"The constrainedness of search","author":"Gent","year":"1996"},{"issue":"4","key":"10.1016\/S1574-6526(06)80007-6_bib66","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","article-title":"Backtrack programming","volume":"12","author":"Golomb","year":"1965","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/S1574-6526(06)80007-6_bib67","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/5236.5237","article-title":"On the complexity of join dependencies","volume":"11","author":"Gyssens","year":"1986","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S1574-6526(06)80007-6_bib68","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0004-3702(88)90081-1","article-title":"Comments on Mohr and Henderson's path consistency algorithm","volume":"36","author":"Han","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib69","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":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib70","series-title":"Constraint Programming: Basics and Trends","article-title":"The design, implementation, and evaluation of the constraint language cc (fd)","author":"Van Hentenryck","year":"1995"},{"key":"10.1016\/S1574-6526(06)80007-6_bib71","series-title":"User's manual","author":"ILOG","year":"1999"},{"key":"10.1016\/S1574-6526(06)80007-6_bib72","series-title":"Proceedings of the IEEE Workshop on Tools for Artificial Intelligence","first-page":"420","article-title":"A filtering process for general constraint-satisfaction problems: Achieving pairwise-consistency using an associated binary representation","author":"Janssen","year":"1989"},{"key":"10.1016\/S1574-6526(06)80007-6_bib73","article-title":"Contribution \u00e1 l'\u00e9tude des probl\u00e8mes de satisfaction de contraintes: algorithmes de propagation et de r\u00e9solution; propagation de contraintes dans les r\u00e9seaux dynamiques","author":"J\u00e9gou","year":"1991","journal-title":"PhD thesis, CRIM, University Montpellier II"},{"key":"10.1016\/S1574-6526(06)80007-6_bib74","series-title":"Proceedings AAAI'93","first-page":"114","article-title":"On the consistency of general constraint-satisfaction problems","author":"J\u00e9gou","year":"1993"},{"key":"10.1016\/S1574-6526(06)80007-6_bib75","series-title":"Proceedings CP'03","first-page":"437","article-title":"Fast bound consistency for the global cardinality constraint","author":"Katriel","year":"2003"},{"issue":"2","key":"10.1016\/S1574-6526(06)80007-6_bib76","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"10.1016\/S1574-6526(06)80007-6_bib77","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0405033","article-title":"The problem of compatible representatives","volume":"5","author":"Knuth","year":"1992","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S1574-6526(06)80007-6_bib78","series-title":"Proceedings JNPC'00","first-page":"151","article-title":"Choco: impl\u00e9mentation du noyau d'un syst\u00e8me de contraintes","author":"Laburthe","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib79","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","article-title":"A language and a program for stating and solving combinatorial problems","volume":"10","author":"Lauri\u00e8re","year":"1978","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib80","series-title":"Proceedings of the FLAIRS'96 workshop on Constraint-based Reasoning (Constraint'96)","article-title":"A bounds-based reduction scheme for difference constraints","author":"Leconte","year":"1996"},{"key":"10.1016\/S1574-6526(06)80007-6_bib81","series-title":"Proceedings CP'03","first-page":"480","article-title":"Exploiting multidirectionality in coarse-grained arc consistency algorithms","author":"Lecoutre","year":"2003"},{"key":"10.1016\/S1574-6526(06)80007-6_bib82","series-title":"Proceedings IJCAI'05","first-page":"199","article-title":"A greedy approach to establish singleton arc consistency","author":"Lecoutre","year":"2005"},{"key":"10.1016\/S1574-6526(06)80007-6_bib83","series-title":"Proceedings IJCAI'93","first-page":"232","article-title":"Consistency techniques for numeric CSPs","author":"Lhomme","year":"1993"},{"key":"10.1016\/S1574-6526(06)80007-6_bib84","series-title":"Proceedings CP'03","first-page":"904","article-title":"Efficient filtering algorithm for disjunction of constraints","author":"Lhomme","year":"2003"},{"key":"10.1016\/S1574-6526(06)80007-6_bib85","series-title":"Proceedings IJCAI'97","first-page":"366","article-title":"Heuristics based on unit propagation for satisfiability problems","author":"Li","year":"1997"},{"key":"10.1016\/S1574-6526(06)80007-6_bib86","article-title":"Consistency in networks of relations","author":"Mackworth","year":"1975"},{"key":"10.1016\/S1574-6526(06)80007-6_bib87","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\/S1574-6526(06)80007-6_bib88","series-title":"Proceedings IJCAI'77","first-page":"598","article-title":"On reading sketch maps","author":"Mackworth","year":"1977"},{"key":"10.1016\/S1574-6526(06)80007-6_bib89","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":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib90","series-title":"Proceedings 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO'96)","first-page":"389","article-title":"A new approach to computing optimal schedules for the job-shop scheduling problem","volume":"volume 1084","author":"Martin","year":"1996"},{"key":"10.1016\/S1574-6526(06)80007-6_bib91","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","article-title":"Relational consistency algorithms and their application in finding subgraph and graph isomorphism","volume":"19","author":"McGregor","year":"1979","journal-title":"Information Science"},{"key":"10.1016\/S1574-6526(06)80007-6_bib92","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":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib93","series-title":"Proceedings ECAI'88","first-page":"651","article-title":"Good old discrete relaxation","author":"Mohr","year":"1988"},{"key":"10.1016\/S1574-6526(06)80007-6_bib94","series-title":"Syntactic and Structural Pattern Recognition","first-page":"217","article-title":"Running efficiently arc consistency","author":"Mohr","year":"1988"},{"key":"10.1016\/S1574-6526(06)80007-6_bib95","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":"Information Science"},{"key":"10.1016\/S1574-6526(06)80007-6_bib96","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\/S1574-6526(06)80007-6_bib97","series-title":"Proceedings International Design Automation Conference (DAC-01)","first-page":"530","article-title":"Chaff: Engineering an efficient sat solver","author":"Moskewicz","year":"2001"},{"key":"10.1016\/S1574-6526(06)80007-6_bib98","series-title":"Search in Artificial Intelligence","first-page":"287","article-title":"Tree search and arc consistency in constraint satisfaction algorithms","author":"Nadel","year":"1988"},{"key":"10.1016\/S1574-6526(06)80007-6_bib99","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","article-title":"Constraint satisfaction algorithms","volume":"5","author":"Nadel","year":"1989","journal-title":"Computational Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib100","series-title":"Proceedings CP'99","first-page":"331","article-title":"Automatic generation of music programs","author":"Pachet","year":"1999"},{"key":"10.1016\/S1574-6526(06)80007-6_bib101","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S1574-6526(06)80007-6_bib102","series-title":"Proceedings CP'00","first-page":"353","article-title":"Singleton consistencies","author":"Prosser","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib103","series-title":"Proceedings AAAI'98","first-page":"359","article-title":"A fast algorithm for the bound consistency of alldiff constraints","author":"Puget","year":"1998"},{"key":"10.1016\/S1574-6526(06)80007-6_bib104","series-title":"Proceedings CP'04","first-page":"542","article-title":"Improved algorithms for the global cardinality constraint","author":"Quimper","year":"2004"},{"key":"10.1016\/S1574-6526(06)80007-6_bib105","series-title":"Proceedings CP'03","first-page":"600","article-title":"An efficient bounds consistency algorithm for the global cardinality constraint","author":"Quimper","year":"2003"},{"key":"10.1016\/S1574-6526(06)80007-6_bib106","series-title":"Proceedings AAAI'94","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSPs","author":"R\u00e9gin","year":"1994"},{"key":"10.1016\/S1574-6526(06)80007-6_bib107","series-title":"Proceedings AAAI'96","first-page":"209","article-title":"Generalized arc consistency for global cardinality constraint","author":"R\u00e9gin","year":"1996"},{"key":"10.1016\/S1574-6526(06)80007-6_bib108","series-title":"Proceedings ECAI'90","first-page":"550","article-title":"On the equivalence of constraint satisfaction problems","author":"Rossi","year":"1990"},{"key":"10.1016\/S1574-6526(06)80007-6_bib109","series-title":"Proceedings of the Third International Conference on Principles and Practice of Declarative Programming","first-page":"115","article-title":"When do bounds and domain propagation lead to the same search space","author":"Schulte","year":"2001"},{"key":"10.1016\/S1574-6526(06)80007-6_bib110","series-title":"Proceedings CP'04","first-page":"619","article-title":"Speeding up constraint propagation","author":"Schulte","year":"2004"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80007-6_bib111","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0218213096000092","article-title":"Path consistency revisited","volume":"5","author":"Singh","year":"1996","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"10.1016\/S1574-6526(06)80007-6_bib112","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0004-3702(97)00064-7","article-title":"No more \u2018partial\u2019 and \u2018full\u2019 looking ahead","volume":"98","author":"Tsang","year":"1998","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80007-6_bib113","article-title":"Lightweight arc-consistency algorithms","author":"van Dongen","year":"2003"},{"key":"10.1016\/S1574-6526(06)80007-6_bib114","series-title":"Proceedings of the Eleventh Irish Conference on Artificial Intelligence and Cognitive Science","first-page":"140","article-title":"Improving arc-consistency algorithms with double-support checks","author":"van Dongen","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib115","series-title":"Constraint Satisfaction in Logic Programming","isbn-type":"print","author":"Van Hentenryck","year":"1989","ISBN":"https:\/\/id.crossref.org\/isbn\/0262081814"},{"key":"10.1016\/S1574-6526(06)80007-6_bib116","series-title":"Proceedings ICLP'91","first-page":"745","article-title":"The cardinality operator: A new logical connective for constraint logic programming","author":"Van Hentenryck","year":"1991"},{"key":"10.1016\/S1574-6526(06)80007-6_bib117","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"},{"issue":"1\u20133","key":"10.1016\/S1574-6526(06)80007-6_bib118","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","article-title":"Design, implementation, and evaluation of the constraint language cc (FD)","volume":"37","author":"Van Hentenryck","year":"1998","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1574-6526(06)80007-6_bib119","series-title":"Proceedings AAAI'99","first-page":"169","article-title":"A generic customizable framework for inverse local consistency","author":"Verfaillie","year":"1999"},{"key":"10.1016\/S1574-6526(06)80007-6_bib120","series-title":"Proceedings IJCAI'93","first-page":"239","article-title":"Why AC-3 is almost always better than AC-4 for establishing arc consistency in CSPs","author":"Wallace","year":"1993"},{"key":"10.1016\/S1574-6526(06)80007-6_bib121","series-title":"Proceedings Ninth Canadian Conference on Artificial Intelligence","first-page":"163","article-title":"Ordering heuristics for arc consistency algorithms","author":"Wallace","year":"1992"},{"key":"10.1016\/S1574-6526(06)80007-6_bib122","series-title":"Errata on singleton consistencies","author":"Walsh","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib123","article-title":"Relational consistencies","author":"Walsh","year":"2001"},{"key":"10.1016\/S1574-6526(06)80007-6_bib124","article-title":"Generating semantic descriptions from drawings of scenes with shadows","author":"Waltz","year":"1972","journal-title":"Tech. Rep. MAC AI-271, MIT"},{"key":"10.1016\/S1574-6526(06)80007-6_bib125","series-title":"Proceedings CP'00","first-page":"470","article-title":"Arc consistency on n-ary monotonic and linear constraints","author":"Zhang","year":"2000"},{"key":"10.1016\/S1574-6526(06)80007-6_bib126","series-title":"Proceedings IJCAI'01","first-page":"316","article-title":"Making AC-3 an optimal algorithm","author":"Zhang","year":"2001"}],"container-title":["Foundations of Artificial Intelligence","Handbook of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800076?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800076?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:52:34Z","timestamp":1761619954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574652606800076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780444527264"],"references-count":126,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(06)80007-6","relation":{},"ISSN":["1574-6526"],"issn-type":[{"value":"1574-6526","type":"print"}],"subject":[],"published":{"date-parts":[[2006]]}}}