{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:15:19Z","timestamp":1725484519020},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"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-45578-7_12","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"168-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Solving Non-binary CSPs Using the Hidden Variable Encoding"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Mamoulis","sequence":"first","affiliation":[]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"unstructured":"F. Bacchus and P. van Beek. On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. In Proceedings of AAAI\u201998, pages 310\u2013318, 1998.","key":"12_CR1"},{"doi-asserted-by":"crossref","unstructured":"A. Beacham, X. Chen, J. Sillito and P. van Beek. Constraint programming lessons learned from crossword puzzles. In Proceedings of the 14th Canadian AI Conf., 2001.","key":"12_CR2","DOI":"10.1007\/3-540-45153-6_8"},{"doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e8re, P. Meseguer, E.C. Freuder, and J. Larrosa. On Forward Checking for Non-binary Constraint Satisfaction. In Proceedings of CP\u201999, pages 88\u2013102, 1999.","key":"12_CR3","DOI":"10.1007\/978-3-540-48085-3_7"},{"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 Proceedings of CP\u201996, pages 61\u201375, 1996.","key":"12_CR4","DOI":"10.1007\/3-540-61551-2_66"},{"unstructured":"C. Bessi\u00e8re and J.C. R\u00e9gin. Arc Consistency for General Constraint Networks: Preliminary Results. In Proceedings of IJCAI\u201997, pages 398\u2013404, 1997.","key":"12_CR5"},{"unstructured":"C. Bessi\u00e8re and J.C. R\u00e9gin. Refining the basic constraint propagation algorithm. In Proceedings of IJCAI\u20192001.","key":"12_CR6"},{"unstructured":"X. Chen. A Theoretical Comparison of Selected CSP Solving and Modeling Techniques. PhD thesis, University of Alberta, Canada, 2000.","key":"12_CR7"},{"unstructured":"R. Debruyne and C. Bessi\u00e8re. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings of IJCAI\u201997, pages 412\u2013417, 1997.","key":"12_CR8"},{"unstructured":"M. Ginsberg, M. Frank, M. Halpin, and M. Torrance. Search lessons learned from crossword puzzles. In Proceedings of AAAI-90, pages 210\u2013215, 1990.","key":"12_CR9"},{"unstructured":"R. Mohr and G. Masini. Good old discrete relaxation. In Proceedings of ECAI\u201988, pages 651\u2013656, 1988.","key":"12_CR10"},{"unstructured":"F. Rossi, C. Petrie, and V. Dhar. On the equivalence of constraint satisfaction problems. In Proceedings of ECAI\u201990, pages 550\u2013556, 1990.","key":"12_CR11"},{"unstructured":"K. Stergiou and T. Walsh. Encodings of Non-Binary Constraint Satisfaction Problems. In Proceedings of AAAI\u201999, pages 163\u2013168, 1999.","key":"12_CR12"},{"unstructured":"K. Stergiou and T. Walsh. On the complexity of arc consistency in the hidden variable encoding of non-binary CSPs. Submitted for publication.","key":"12_CR13"},{"unstructured":"Y. Zhang and R. Yap. Making AC-3 an optimal algorithm. In Proceedings of IJCAI\u2019 2001.","key":"12_CR14"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T09:04:37Z","timestamp":1585559077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}