{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:13:17Z","timestamp":1743009197297,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421443"},{"type":"electronic","value":"9783540451532"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45153-6_8","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T15:24:20Z","timestamp":1194967460000},"page":"78-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Constraint Programming Lessons Learned from Crossword Puzzles"],"prefix":"10.1007","author":[{"given":"Adam","family":"Beacham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinguang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Sillito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"van Beek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,16]]},"reference":[{"key":"8_CR1","unstructured":"P. Baptiste and C. Le Pape. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In Proc. of IJCAI-95, pp. 600\u2013606."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e8re and J.-C. R\u00e9gin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proc. of CP-96, pp. 61\u201375.","DOI":"10.1007\/3-540-61551-2_66"},{"key":"8_CR3","unstructured":"C. Bessi\u00e8re and J.-C. R\u00e9gin. Arc consistency for general constraint networks: Preliminary results. In Proc. of IJCAI-97, pp. 398\u2013404."},{"key":"8_CR4","unstructured":"P. R. Cohen. Empirical Methods for Artificial Intelligence. The MIT Press, 1995."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","volume":"81","author":"J. M. Crawford","year":"1996","unstructured":"J. M. Crawford and L. D. Auton. Experimental results on the crossover point in random 3-SAT. Artif. Intell., 81:31\u201357, 1996.","journal-title":"Artif. Intell."},{"key":"8_CR6","unstructured":"D. Frost and R. Dechter. In search of the best search: An empirical evaluation. In Proc. of AAAI-94, pp. 301\u2013306."},{"key":"8_CR7","unstructured":"J. Gaschnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisfying assignment problems. In Proc. of the 2nd Canadian Conf. on AI, pp. 268\u2013277, 1978."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"I. P. Gent, E. MacIntyre, P. Prosser, B. M. Smith, and T. Walsh. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In Proc. of CP-96, pp. 179\u2013193.","DOI":"10.1007\/3-540-61551-2_74"},{"key":"8_CR9","unstructured":"M. L. Ginsberg, M. Frank, M. P. Halpin, and M. C. Torrance. Search lessons learned from crossword puzzles. In Proc. of AAAI-90, pp. 210\u2013215."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. M. Haralick","year":"1980","unstructured":"R. M. Haralick and G. L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell., 14:263\u2013313, 1980.","journal-title":"Artif. Intell."},{"key":"8_CR11","unstructured":"H. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI-92, pp. 359\u2013363."},{"key":"8_CR12","unstructured":"A. K. Mackworth. On reading sketch maps. In Proc. of IJCAI-77, pp. 598\u2013606."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/64.54670","volume":"5","author":"B. A. Nadel","year":"1990","unstructured":"B. A. Nadel. Representation selection for constraint satisfaction: A case study using n-queens. IEEE Expert, 5:16\u201323, 1990.","journal-title":"IEEE Expert"},{"key":"8_CR14","first-page":"268","volume":"9","author":"P. Prosser","year":"1993","unstructured":"P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Comput. In-tell., 9:268\u2013299, 1993.","journal-title":"Comput. In-tell."},{"key":"8_CR15","unstructured":"J.-F. Puget and M. Leconte. Beyond the glass box: Constraints as objects. In Proc. of ISLP-95, pp. 513\u2013527."},{"key":"8_CR16","unstructured":"F. Rossi, C. Petrie, and V. Dhar. On the equivalence of constraint satisfaction problems. In Proc. of ECAI-90, pp. 550\u2013556."},{"key":"8_CR17","unstructured":"B. Smith, K. Stergiou, and T. Walsh. Using auxilliary variables and implied constraints to model non-binary problems. In Proc. of AAAI-00."},{"key":"8_CR18","unstructured":"E. P. K. Tsang, J. E. Borrett, and A. C. M. Kwan. An attempt to map the performance of a range of algorithm and heuristic combinations. In Proc. of the AI and Simulated Behaviour Conf., pp. 203\u2013216, 1995."},{"key":"8_CR19","unstructured":"T. Walsh. SAT v CSP. In Proc. of CP-00."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45153-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:51:48Z","timestamp":1558263108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45153-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421443","9783540451532"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45153-6_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"16 May 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}