{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:55:04Z","timestamp":1770479704539,"version":"3.49.0"},"publisher-location":"Boston","reference-count":43,"publisher":"Kluwer Academic Publishers","isbn-type":[{"value":"1402072635","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-306-48056-5_14","type":"book-chapter","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T18:26:26Z","timestamp":1138904786000},"page":"405-428","source":"Crossref","is-referenced-by-count":1,"title":["Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Eugene C.","family":"Freuder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00162-X","volume":"135","author":"J. Amilhastre","year":"2002","unstructured":"J. Amilhastre, H. Fargier and P. Marquis (2002) Consistency restoration and explanations in dynamic CSPs\u2014application to configuration. Artificial Intelligence, 135, 199\u2013234.","journal-title":"Artificial Intelligence"},{"key":"14_CR2","unstructured":"F. Bacchus, X. Chen, P. van Beek and T. Walsh (2002) Binary vs. non-binary constraints. Artificial Intelligence."},{"key":"14_CR3","unstructured":"B. De Backer, V. Furnon, P. Prosser, P. Kilby and P. Shaw (1997) Local search in constraint programming: Application to the vehicle routing problem. Presented at the CP-97 Workshop on Industrial Constraint-based Scheduling."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0004-3702(98)00105-2","volume":"107","author":"C. Bessiere","year":"1999","unstructured":"C. Bessiere, E. Freuder and J. Regin (1999) Using constraint metaknowledge to reduce arc consistency computation, Artificial Intelligence, 107, 125\u2013148.","journal-title":"Artificial Intelligence"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-61479-6_19","volume-title":"Over-Constrained Systems","author":"S. Bistarelli","year":"1996","unstructured":"S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaille (1996) Semiring-based CSPs and valued CSPs: Basic properties. In: M. Jampel, E.C. Freuder and M. Maher (eds.), Over-Constrained Systems, Volume 1106 of Lecture Notes in Computer Science. Springer, Berlin, pp. 111\u2013150."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/A:1009894810205","volume":"4","author":"B. Cheng","year":"1999","unstructured":"B. Cheng, K. Choi, J. Lee and J. Wu (1999) Increasing constraint propagation by redundant modeling: an experience report. Constraints, 4, 167\u2013192.","journal-title":"Constraints"},{"key":"14_CR7","first-page":"331","volume-title":"Proceedings Twelth International Joint Conference in Artificial Intelligence","author":"P. Cheeseman","year":"1991","unstructured":"P. Cheeseman, B. Kanefsky and W. Taylor (1991) Where the really hard problems are. In: Proceedings Twelth International Joint Conference in Artificial Intelligence. Morgan Kaufmann, San Mateo, pp. 331\u2013337."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","volume":"14","author":"R. Debruyne","year":"2001","unstructured":"R. Debruyne and C. Bessi\u00e8re (2001) Domain filtering consistencies. Journal of Artificial Intelligence Research, 14, 205\u2013230.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R. Dechter","year":"1990","unstructured":"R. Dechter (1990). Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artificial Intelligence, 41, 273\u2013312.","journal-title":"Artificial Intelligence"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0004-3702(02)00120-0","volume":"136","author":"R. Dechter","year":"2002","unstructured":"R. Dechter and D. Frost (2002) Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence, 136, 147\u2013188.","journal-title":"Artificial Intelligence"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Analysis and Visualization Tools for Constraint Programming","year":"2000","unstructured":"P. Deransart, M. Hermenegildo and J. Maluszynski (eds.) (2000) Analysis and Visualization Tools for Constraint Programming. Lecture Notes in Computer Science No. 1870. Springer, Berlin."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri and J. Pearl (1991) Temporal constraint networks. Artificial Intelligence, 49, 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","volume":"11","author":"E. Freuder","year":"1978","unstructured":"E. Freuder (1978) Synthesizing constraint expressions. Communications of the ACM, 11, 958\u2013966.","journal-title":"Communications of the ACM"},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. Freuder","year":"1982","unstructured":"E. Freuder (1982) A sufficient condition for backtrack-free search. Journal of the Association for Computing Machinery, 29, 24\u201332.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"14_CR15","first-page":"227","volume-title":"Proceedings Ninth National Conference on Artificial Intelligence","author":"E. Freuder","year":"1991","unstructured":"E. Freuder (1991) Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings Ninth National Conference on Artificial Intelligence. AAAI Press\/MIT, Menlo Park\/Cambridge, pp. 227\u2013233."},{"key":"14_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(92)90002-F","volume":"58","author":"E. Freuder","year":"1992","unstructured":"E. Freuder and R. Wallace (1992). Partial constraint satisfaction. Artificial Intelligence, 58, 1\u201370.","journal-title":"Artificial Intelligence"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"F. Focacci, A. Lodi and M. Milano (1999) Cost-based domain filtering. In: J. Jaffar (ed.), Principles and Practice of Constraint Programming Volume 1713 of Lecture Notes in Computer Science. Springer.","DOI":"10.1007\/978-3-540-48085-3_14"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"C. Gomes, B. Selman and N. Crato (1997) Heavy-tailed Distributions in Combinatorial Search. Volume 1330 of Lecture Notes in Computer Science. Springer.","DOI":"10.1007\/BFb0017434"},{"key":"14_CR19","unstructured":"W. Harvey and M. Ginsberg (1995) Limited discrepancy search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). Morgan Kaufmann, pp. 607\u2013615."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P. Jeavons","year":"1997","unstructured":"P. Jeavons, D. Cohen and M. Gyssens (1997) Closure properties of constraints. Journal of the ACM, 44, 527\u2013548.","journal-title":"Journal of the ACM"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez (1987) Constraint logic programming. Proceedings of the Annual ACM Symposium on Principles of Programming Languages (POPL). ACM, pp. 111\u2013119.","DOI":"10.1145\/41625.41635"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","volume":"89","author":"G. Kondrak","year":"1997","unstructured":"G. Kondrak and P. van Beek (1997) A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence, 89, 365\u2013387.","journal-title":"Artificial Intelligence"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"F. Laburthe and Y. Caseau (1998) SALSA: a language for search algorithms. 4th International Conference on the Principles and Practice of Constraint Programming (CP\u201998). Pisa, Italy, October.","DOI":"10.1007\/3-540-49481-2_23"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"A. Mackworth (1977) Consistency in networks of relations. Artificial Intelligence, 8, 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1","author":"S. Minton","year":"1996","unstructured":"S. Minton (1996) Automatically configuring constraint satisfaction programs. A case study. Constraints, 1, 7\u201343.","journal-title":"Constraints"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M.D. Johnston, A.B. Philips and P. Laird (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling. Artificial Intelligence, 58, 61\u2013205.","journal-title":"Artificial Intelligence"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"L. Michel and P. Van Hentenryck (1999) Localizer: a modeling language for local search. INFORMS. Journal on Computing.","DOI":"10.1287\/ijoc.11.1.1"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-61551-2_86","volume-title":"Principles and Practice of Constraint Programming CP96: Proceedings of the Second International Conference","author":"G. Pesant","year":"1996","unstructured":"G. Pesant and M. Gendreau (1996) A view of local search in constraint programming. In: Principles and Practice of Constraint Programming CP96: Proceedings of the Second International Conference, Volume 1118 of Lecture Notes in Computer Science. Springer, Berlin, pp. 353\u2013366."},{"key":"14_CR29","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1090\/dimacs\/057\/07","volume-title":"Constraint Programming and Large Scale Discrete Optimization","author":"J.-C. R\u00e9gin","year":"2001","unstructured":"J.-C. R\u00e9gin (2001) Minimization of the number of breaks in sports scheduling problems using constraint programming. In: E. Freuder and R. Wallace (eds.), Constraint Programming and Large Scale Discrete Optimization, volume 57 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, pp. 115\u2013130."},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017438","volume-title":"Principles and Practice of Constraint Programming\u2014CP97: Proceedings of the Third International Conference","author":"D. Sabin","year":"1997","unstructured":"D. Sabin and E. Freuder (1997) Understanding and Improving the MAC Algorithm. In: Principles and Practice of Constraint Programming\u2014CP97: Proceedings of the Third International Conference, volume 1330 of Lecture Notes in Computer Science. Springer, Berlin, pp. 167\u2013181."},{"key":"14_CR31","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1287\/opre.18.3.549","volume":"18","author":"H.M. Salkin","year":"1970","unstructured":"H.M. Salkin (1970) On the merit of the generalized origin and restarts in implicit enumeration. Operations Research, 18, 549\u2013554.","journal-title":"Operations Research"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"P. Shaw (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Michael Maher and Jean Francois Puget (eds.), Principles and Practice of Constraint Programming CP98, Volume 1520 of Lecture Notes in Computer Science. Springer. pp. 417\u2013431.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"14_CR33","first-page":"440","volume-title":"Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92)","author":"B. Selman","year":"1992","unstructured":"B. Selman, H. Levesque and D. Mitchell (1992) A new method for solving hard satisfiability problems. Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92). San Jose, CA, USA, pp. 440\u2013446."},{"key":"14_CR34","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"E. Tsang (1993) Foundations of Constraint Satisfaction. Academic Press, London."},{"key":"14_CR35","volume-title":"The OPL Optimization Programming Language","author":"P. Hentenryck Van","year":"1999","unstructured":"Pascal Van Hentenryck (1999) The OPL Optimization Programming Language. The MIT Press, Cambridge, MA."},{"key":"14_CR36","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Hentenryck Van","year":"1992","unstructured":"P. Van Hentenryck, H. Simonis and M. Dincbas (1992) Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58, 113\u2013159.","journal-title":"Artificial Intelligence"},{"key":"14_CR37","unstructured":"G. Verfaillie, M. Lemaitre and T. Schiex (1996) Russian doll search for solving constraint optimization problems. Proceedings of AAAI, pp. 181\u2013187."},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"A. Veron, K. Schuerman and M. Reeve (1993) Why and how in the ElipSys OR-parallel CLP system. Proceedings of PARLE.","DOI":"10.1007\/3-540-56891-3_23"},{"issue":"1","key":"14_CR39","first-page":"159","volume":"12","author":"M. Wallace","year":"1997","unstructured":"M. Wallace, S. Novello and J. Schimpf (1997) ECLiPSe\u2014a platform for constraint programming. ICL Systems Journal 12(1), 159\u2013200.","journal-title":"ICL Systems Journal"},{"key":"14_CR40","unstructured":"T. Walsh (2002) Stochastic constraint programming. Proceedings of ECAI-2002."},{"key":"14_CR41","unstructured":"M. Yokoo (1994) Weak-commitment search for solving constraint satisfaction problems. Proceedings of AAAI, pp. 313\u2013318."},{"key":"14_CR42","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M. Yokoo","year":"1998","unstructured":"M. Yokoo, E. Durfee, T. Ishida and K. Kuwabara (1998) The distributed CSP: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10, 673\u2013685.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"14_CR43","unstructured":"W. Zhang (1998) Complete anytime beam search. Proceedings of AAAI, pp. 425\u2013430."}],"container-title":["International Series in Operations Research & Management Science","Handbook of Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-306-48056-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T04:20:18Z","timestamp":1619497218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-306-48056-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402072635"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/0-306-48056-5_14","relation":{},"subject":[]}}