{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:08:34Z","timestamp":1742958514675,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042430"},{"type":"electronic","value":"9783642042447"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04244-7_44","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:17:24Z","timestamp":1252937844000},"page":"554-568","source":"Crossref","is-referenced-by-count":0,"title":["Failed Value Consistencies for Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Lecoutre","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Roussel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"key":"44_CR2","unstructured":"Bennaceur, H., Lecoutre, C., Roussel, O.: A decomposition technique for solving Max-CSP. In: Proceedings of ECAI 2008, pp. 500\u2013504 (2008)"},{"key":"44_CR3","volume-title":"Handbook of Constraint Programming","author":"C. Bessiere","year":"2006","unstructured":"Bessiere, C.: Constraint propagation. In: Handbook of Constraint Programming, ch.\u00a03. Elsevier, Amsterdam (2006)"},{"issue":"6-7","key":"44_CR4","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.artint.2007.10.016","volume":"72","author":"C. Bessiere","year":"2008","unstructured":"Bessiere, C., Stergiou, K., Walsh, T.: Domain filtering consistencies for non-binary constraints. Artificial Intelligence\u00a072(6-7), 800\u2013822 (2008)","journal-title":"Artificial Intelligence"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(96)00018-5","volume":"90","author":"M.C. Cooper","year":"1997","unstructured":"Cooper, M.C.: Fundamental properties of neighbourhood substitution in constraint satisfaction problems. Artificial Intelligence\u00a090, 1\u201324 (1997)","journal-title":"Artificial Intelligence"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","volume":"14","author":"R. Debruyne","year":"2001","unstructured":"Debruyne, R., Bessiere, C.: Domain filtering consistencies. Journal of Artificial Intelligence Research\u00a014, 205\u2013230 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"44_CR7","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint processing. Morgan Kaufmann, San Francisco (2003)"},{"issue":"1","key":"44_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(97)86737-0","volume":"173","author":"R. Dechter","year":"1997","unstructured":"Dechter, R., van Beek, P.: Local and global relational consistency. Theoretical Computer Science\u00a0173(1), 283\u2013308 (1997)","journal-title":"Theoretical Computer Science"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45578-7_6","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"F. Focacci","year":"2001","unstructured":"Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 77\u201392. Springer, Heidelberg (2001)"},{"issue":"4","key":"44_CR10","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E.C. Freuder","year":"1985","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-bounded search. Journal of the ACM\u00a032(4), 755\u2013761 (1985)","journal-title":"Journal of the ACM"},{"key":"44_CR11","unstructured":"Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of AAAI 1991, pp. 227\u2013233 (1991)"},{"key":"44_CR12","unstructured":"Freuder, E.C., Elfe, C.: Neighborhood inverse consistency preprocessing. In: Proceedings of AAAI 1996, pp. 202\u2013208 (1996)"},{"key":"44_CR13","unstructured":"Freuder, E.C., Hubbe, P.D.: Using inferred disjunctive constraints to decompose constraint satisfaction problems. In: Proceedings of IJCAI 1993, pp. 254\u2013261 (1993)"},{"issue":"1","key":"44_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0743-1066(89)90009-5","volume":"7","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Urbani, G.: Algorithms for testing the satisfiability of propositional formulae. Journal of Logic Programming\u00a07(1), 45\u201361 (1989)","journal-title":"Journal of Logic Programming"},{"key":"44_CR15","unstructured":"Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Proceedings of AAAI 2005, pp. 390\u2013396 (2005)"},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Lecoutre, C.: Constraint networks: techniques and algorithms. ISTE\/Wiley (2009)","DOI":"10.1002\/9780470611821"},{"key":"44_CR17","unstructured":"Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of IJCAI 2007, pp. 125\u2013130 (2007)"},{"key":"44_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-540-74970-7_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"C. Lecoutre","year":"2007","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Exploiting past and future: Pruning by inconsistent partial state dominance. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 453\u2013467. Springer, Heidelberg (2007)"},{"issue":"1","key":"44_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"44_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Network of constraints: Fundamental properties and applications to picture processing. Information Science\u00a07, 95\u2013132 (1974)","journal-title":"Information Science"},{"issue":"4","key":"44_CR21","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/TPAMI.1984.4767555","volume":"6","author":"P.W. Purdom","year":"1984","unstructured":"Purdom, P.W.: Solving satisfiability with less searching. IEEE transactions on pattern analysis and machine intelligence\u00a06(4), 510\u2013513 (1984)","journal-title":"IEEE transactions on pattern analysis and machine intelligence"},{"issue":"2","key":"44_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10601-007-9016-x","volume":"12","author":"I. Razgon","year":"2007","unstructured":"Razgon, I., Meisels, A.: A CSP search algorithm with responsibility sets and kernels. Constraints\u00a012(2), 151\u2013177 (2007)","journal-title":"Constraints"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of CP 1994, pp. 10\u201320 (1994)","DOI":"10.1007\/3-540-58601-6_86"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04244-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:34:00Z","timestamp":1558269240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04244-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042430","9783642042447"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04244-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}