{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:33:20Z","timestamp":1694630000285},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T00:00:00Z","timestamp":1177718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T00:00:00Z","timestamp":1177718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10601-007-9016-x","type":"journal-article","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T01:36:13Z","timestamp":1177637773000},"page":"151-177","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A CSP Search Algorithm with Responsibility Sets and Kernels"],"prefix":"10.1007","volume":"12","author":[{"given":"Igor","family":"Razgon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Meisels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,28]]},"reference":[{"key":"9016_CR1","doi-asserted-by":"crossref","unstructured":"Bacchus, F. (2000). Extending forward checking. In Principles and practice of constraint programming (pp. 35\u201351).","DOI":"10.1007\/3-540-45349-0_5"},{"key":"9016_CR2","first-page":"326","volume-title":"Proceedings of AAAI","author":"B. Choueiry","year":"1998","unstructured":"Choueiry, B., & Noubir, G. (1998). On the computation of local interchangeability in discrete constraint satisfaction problems. In Proceedings of AAAI (pp. 326\u2013333). Menlo Park, CA: AAAI."},{"key":"9016_CR3","first-page":"93","volume-title":"CP2001","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In CP2001 (pp. 93\u2013108). Berlin: Springer."},{"key":"9016_CR4","first-page":"93","volume-title":"CP2001","author":"F. Focacci","year":"2001","unstructured":"Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In CP2001 (pp. 93\u2013108). Berlin: Springer."},{"key":"9016_CR5","unstructured":"Frost, D., & Dechter, R. (1995). Look-ahead value ordering for constraint satisfaction problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI\u201995 (pp. 572\u2013578). Montreal, Canada."},{"key":"9016_CR6","doi-asserted-by":"crossref","unstructured":"Gent, I., MacIntyre, E., Prosser, P., Smith, B., & Walsh, T. (1996). An empirical study of dynamic variable ordering heuristics. In CP-96 (pp. 179\u2013193).","DOI":"10.1007\/3-540-61551-2_74"},{"key":"9016_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. Ginsberg","year":"1993","unstructured":"Ginsberg, M. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25\u201346.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9016_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. M. Haralick","year":"1980","unstructured":"Haralick, R. M., & Elliott, G. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14, 263\u2013313.","journal-title":"Artificial Intelligence"},{"key":"9016_CR9","doi-asserted-by":"crossref","unstructured":"Jussien, N., Debruyne, R., & Boizumault, P. (2000). Maintaining arc-consistency within dynamic backtracking. In Principles and practice of constraint programming (CP 2000) (pp. 249\u2013261). Singapore, Springer","DOI":"10.1007\/3-540-45349-0_19"},{"key":"9016_CR10","first-page":"1","volume-title":"CP2003","author":"H. Kautz","year":"2003","unstructured":"Kautz, H., & Selman, B. (2003). Ten challenges redux: Recent progress in propositional reasoning and search. In CP2003 (pp. 1\u201318). Berlin: Springer."},{"key":"9016_CR11","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P. (1993) Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9, 268\u2013299.","journal-title":"Computational Intelligence"},{"key":"9016_CR12","unstructured":"Prosser, P. (1995). MAC-CBJ: Maintaining Arc Consistency with Conflict-directed Backjumping. Technical Report, Research Report\/95\/177, Department of Computer Science, University of Strathclyde."},{"key":"9016_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(95)00048-8","volume":"81","author":"P. Prosser","year":"1996","unstructured":"Prosser, P. (1996). An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 81\u2013109.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9016_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10601-004-5306-8","volume":"10","author":"J. Puget","year":"2005","unstructured":"Puget, J. (2005). Symmetry breaking revisited. Constraints, 10(1), 23\u201346.","journal-title":"Constraints"},{"key":"9016_CR15","first-page":"542","volume-title":"Principles and practice of constraint programming-CP2004, Toronto, Canada","author":"C.-G. Quimper","year":"2004","unstructured":"Quimper, C.-G., Lopez-Ortiz, A., vanBeek, P., & Golynski, A. (2004). Improved algorithms for the global cardinality constraint. In Principles and practice of constraint programming-CP2004, Toronto, Canada (pp. 542\u2013556). Berlin: Springer."},{"key":"9016_CR16","first-page":"945","volume-title":"Principles and practice of constraint programming-CP2003, Kinsale, Ireland","author":"I. Razgon","year":"2003","unstructured":"Razgon, I., & Meisels, A. (2003). Maintaining dominance consistency. In Principles and practice of constraint programming-CP2003, Kinsale, Ireland (pp. 945\u2013950). Berlin: Springer."},{"key":"9016_CR17","doi-asserted-by":"crossref","unstructured":"Razgon, I., & Meisels, A. (2004). Pruning by equally constrained variables. In Proceedings of CSCLP 2004 (pp. 26\u201340).","DOI":"10.1007\/11402763_3"},{"key":"9016_CR18","first-page":"362","volume-title":"AAAI \u201994: Proceedings of the twelfth national conference on artificial intelligence vol.1","author":"J.-C. Regin","year":"1994","unstructured":"Regin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In AAAI \u201994: Proceedings of the twelfth national conference on artificial intelligence (Vol. 1, pp. 362\u2013367). Menlo Park, CA: American Association for Artificial Intelligence."},{"key":"9016_CR19","doi-asserted-by":"crossref","unstructured":"Sabin, D., & Freuder, E.\u00a0C. (1994). Contradicting conventional wisdom in constraint satisfaction. In PPCP\u201994 (pp. 10\u201320).","DOI":"10.1007\/3-540-58601-6_86"},{"key":"9016_CR20","unstructured":"Wallace, R. (2005). Analysis of heuristic synergies. In CSCLP 2005 (pp. 1\u201313)."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9016-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-007-9016-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9016-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-007-9016-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T20:46:33Z","timestamp":1652906793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-007-9016-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,28]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9016"],"URL":"https:\/\/doi.org\/10.1007\/s10601-007-9016-x","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,28]]},"assertion":[{"value":"28 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}