{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:27:59Z","timestamp":1725517679853},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857754"},{"type":"electronic","value":"9783540857761"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85776-1_34","type":"book-chapter","created":{"date-parts":[[2008,8,23]],"date-time":"2008-08-23T08:01:12Z","timestamp":1219478472000},"page":"380-384","source":"Crossref","is-referenced-by-count":2,"title":["Interleaved Alldifferent Constraints: CSP vs. SAT Approaches"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Lardeux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_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)"},{"issue":"4","key":"34_CR2","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 Comput. Surv.\u00a038(4), 12 (2006)","journal-title":"ACM Comput. Surv."},{"key":"34_CR3","unstructured":"Gent, I.: Arc consistncy in SAT. Technical Report APES-39A-2002, University of St Andrews (2002)"},{"key":"34_CR4","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraint of difference in csps. In: National Conference of Artificial Intelligence, pp. 362\u2013367 (1994)"},{"key":"34_CR5","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","Artificial Intelligence: Methodology, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85776-1_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:17Z","timestamp":1619509757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85776-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540857754","9783540857761"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85776-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}