{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:06:27Z","timestamp":1743123987899,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_42","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"560-565","source":"Crossref","is-referenced-by-count":9,"title":["Edge Matching Puzzles as Hard SAT\/CSP Benchmarks"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Ans\u00f3tegui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"Fern\u00e0ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Mateu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Proceedings of the AAAI 2000, pp. 256\u2013261. AAAI Press \/ The MIT Press (2000)"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., B\u00e9jar, R., Fern\u00e0ndez, C., Mateu, C.: Edge matching puzzles as hard SAT\/CSP benchmarks (extended version). Technical Report TR-1-08, Dept. of Computer Science, Universitat de Lleida (2008), http:\/\/ccia.udl.cat\/images\/stories\/Papers\/techrep1_08.pdf","DOI":"10.1007\/978-3-540-85958-1_42"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In: Principles and Practice of Constraint Programming, pp. 61\u201375 (1996)","DOI":"10.1007\/3-540-61551-2_66"},{"issue":"s1","key":"42_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs and Combinatorics\u00a023(s1), 195 (2007)","journal-title":"Graphs and Combinatorics"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchinna, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic phase transitions. Nature\u00a0400, 133\u2013137 (1999)","journal-title":"Nature"},{"key":"42_CR6","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the AAAI 1994, pp. 362\u2013367. AAAI Press \/ The MIT Press (1994)"},{"key":"42_CR7","first-page":"420","volume-title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999","author":"J.-C. R\u00e9gin","year":"1999","unstructured":"R\u00e9gin, J.-C.: The symmetric alldiff constraint. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, pp. 420\u2013425. Morgan Kaufmann, San Francisco (1999)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:45:46Z","timestamp":1738370746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}