{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:43:10Z","timestamp":1725540190977},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642052576"},{"type":"electronic","value":"9783642052583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05258-3_32","type":"book-chapter","created":{"date-parts":[[2009,10,31]],"date-time":"2009-10-31T15:14:41Z","timestamp":1257002081000},"page":"360-371","source":"Crossref","is-referenced-by-count":3,"title":["SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints"],"prefix":"10.1007","author":[{"given":"Frederic","family":"Lardeux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederic","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K. Apt","year":"2003","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F. Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC via unit propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 133\u2013147. Springer, Heidelberg (2007)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient cnf encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","first-page":"400","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Bessi\u00e8re","year":"2003","unstructured":"Bessi\u00e8re, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 400\u2013407. Springer, Heidelberg (2003)"},{"issue":"4","key":"32_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1177352.1177354","volume":"38","author":"L. Bordeaux","year":"2006","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: A comparative survey. ACM Compututing Survey\u00a038(4), 12 (2006)","journal-title":"ACM Compututing Survey"},{"issue":"7","key":"32_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/11889205_12","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"Y. Dimopoulos","year":"2006","unstructured":"Dimopoulos, Y., Stergiou, K.: Propagation in csp and sat. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 137\u2013151. Springer, Heidelberg (2006)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/978-3-540-74970-7_59","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"M. Gavanelli","year":"2007","unstructured":"Gavanelli, M.: The log-support encoding of csp into sat. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 815\u2013822. Springer, Heidelberg (2007)"},{"key":"32_CR9","unstructured":"Gent, I.: Arc consistency in SAT. Technical Report APES-39A-2002, University of St Andrews (2002)"},{"key":"32_CR10","unstructured":"Gent, I., Nightingale, P.: A new encoding of all different into sat. In: Proc. of 3rd Int. Work. on Modelling and Reformulating CSP, CP 2004, pp. 95\u2013110 (2004)"},{"key":"32_CR11","first-page":"296","volume-title":"IJCAI 1999","author":"H.H. Hoos","year":"1999","unstructured":"Hoos, H.H.: Sat-encodings, search space structure, and local search performance. In: IJCAI 1999, pp. 296\u2013303. Morgan Kaufmann, San Francisco (1999)"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-74970-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"J. Marques-Silva","year":"2007","unstructured":"Marques-Silva, J., Lynce, I.: Towards robust cnf encodings of cardinality constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 483\u2013497. Springer, Heidelberg (2007)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/378239.379017","volume-title":"DAC 2001","author":"M. Moskewicz","year":"2001","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/978-3-540-30201-8_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.-C. R\u00e9gin","year":"2004","unstructured":"R\u00e9gin, J.-C., Gomes, C.: The cardinality matrix constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 572\u2013587. Springer, Heidelberg (2004)"},{"key":"32_CR15","unstructured":"R\u00e9gin, J.: A filtering algorithm for constraint of difference in csps. In: Nat. Conf. of AI, pp. 362\u2013367 (1994)"},{"key":"32_CR16","unstructured":"Simonis, H.: Sudoku as a constraint problem. In: Proc. of the 4th CP Int. Work. on Modelling and Reformulating Constraint Satisfaction Problems, pp. 17\u201327 (2005)"},{"key":"32_CR17","unstructured":"Sudopedia, http:\/\/www.sudopedia.org"},{"key":"32_CR18","volume-title":"Handbook of Constraint Programming","author":"W.-J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.-J., Katriel, I.: Global Constraints. In: Handbook of Constraint Programming, Elsevier, Amsterdam (2006)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.M., Sabharwal, A.: New filtering algorithms for combinations of among constraints (under review, 2008)","DOI":"10.1007\/s10601-008-9067-7"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11757375_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"W.-J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.-J., R\u00e9gin, J.-C.: Open constraints in a closed world. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 244\u2013257. Springer, Heidelberg (2006)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2009: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05258-3_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:50:09Z","timestamp":1606186209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05258-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642052576","9783642052583"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05258-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}