{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T21:40:22Z","timestamp":1740346822415,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219378"},{"type":"electronic","value":"9783540246749"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24674-9_37","type":"book-chapter","created":{"date-parts":[[2010,8,5]],"date-time":"2010-08-05T01:36:21Z","timestamp":1280972181000},"page":"352-361","source":"Crossref","is-referenced-by-count":0,"title":["Arc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Samaras","sequence":"first","affiliation":[]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Bacchus, F., Van Beek, P.: On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. In: Proceedings of AAAI 1998, pp. 310\u2013318 (1998)","key":"37_CR1"},{"unstructured":"Bacchus, F., Chen, X., van Beek, P., Walsh, T.: Binary vs. Non-Binary CSPs. Artificial Intelligence (2002)","key":"37_CR2"},{"doi-asserted-by":"crossref","unstructured":"Beacham, A., Chen, X., Sillito, J., Van Beek, P.: Constraint Programming Lessons Learned from Crossword Puzzles. In: Proceedings of the 14th Canadian Conference in AI 2001, Canada (2001)","key":"37_CR3","DOI":"10.1007\/3-540-45153-6_8"},{"unstructured":"Bessi\u00e8re, C., Freuder, E.C., R\u00e9gin, J.C.: Using Inference to reduce Arc Consistency Computation. In: Proceedings of IJCAI 1995, pp. 592\u2013599 (1995)","key":"37_CR4"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-540-48085-3_7","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"C. Bessi\u00e8re","year":"1999","unstructured":"Bessi\u00e8re, C., Meseguer, P., Freuder, E.C., Larrosa, J.: On Forward Checking for Non-binary Constraint Satisfaction. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 88\u2013102. Springer, Heidelberg (1999)"},{"unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.C.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI 2001 (2001)","key":"37_CR6"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree Clustering for Constraint Networks. Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"unstructured":"Ginsberg, M., Frank, M., Halpin, M., Torrance, M.: Search Lessons learned from Crossword Puzzles. In: Proceedings of AAAI 1990, pp. 210\u2013215 (1990)","key":"37_CR8"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P. Hentenryck Van","year":"1992","unstructured":"Van Hentenryck, P., Deville, Y., Teng, C.: A Generic Arc Consistency Algorithm and its specializations. Artificial Intelligence\u00a057, 291\u2013321 (1992)","journal-title":"Artificial Intelligence"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-45578-7_12","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Mamoulis","year":"2001","unstructured":"Mamoulis, N., Stergiou, K.: Solving non-binary CSPs using the Hidden Variable Encoding. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, p. 168. Springer, Heidelberg (2001)"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1011039901653","volume":"15","author":"I. Miguel","year":"2001","unstructured":"Miguel, I., Shen, Q.: Solution Techniques for Constraint Satisfaction Problems: Foundations. Artificial Intelligence Review\u00a015, 243\u2013267 (2001)","journal-title":"Artificial Intelligence Review"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mhor","year":"1986","unstructured":"Mhor, R., Masini, G.: Arc and Path Consistency revisited. Artificial Intelligence\u00a028, 225\u2013233 (1986)","journal-title":"Artificial Intelligence"},{"unstructured":"Rossi, F., Petrie, C., Dhar, V.: On the equivalence of constraint satisfaction problems. In: Proceedings of ECAI 1990, pp. 550\u2013556 (1990)","key":"37_CR13"},{"unstructured":"Stergiou, K., Walsh, T.: Encodings of Non-Binary Constraint Satisfaction Problems. In: Proceedings of AAAI 1999, pp. 163\u2013168 (1999)","key":"37_CR14"},{"doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yap, R.: Making AC-3 an optimal algorithm. In: Proceedings of IJCAI 2001 (2001)","key":"37_CR15","DOI":"10.1049\/cp:20010551"}],"container-title":["Lecture Notes in Computer Science","Methods and Applications of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24674-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T21:06:47Z","timestamp":1740344807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24674-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219378","9783540246749"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24674-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}