{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T14:21:24Z","timestamp":1790691684282,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540749691","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_59","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"815-822","source":"Crossref","is-referenced-by-count":20,"title":["The Log-Support Encoding of CSP into SAT"],"prefix":"10.1007","author":[{"given":"Marco","family":"Gavanelli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"59_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Ans\u00f3tegui","year":"2005","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F.: Mapping problems with finite-domain variables to problems with boolean variables. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, Springer, Heidelberg (2005)"},{"key":"59_CR2","unstructured":"Le Berre, D., Simon, L.: SAT competition (2005), \n                    \n                      www.satcompetition.org\/2005\/"},{"key":"59_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Herbrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919. Springer, Heidelberg (2004)"},{"key":"59_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/11875604_61","volume-title":"Foundations of Intelligent Systems","author":"M. Cadoli","year":"2006","unstructured":"Cadoli, M., Mancini, T., Patrizi, F.: SAT as an effective solving technology for constraint problems. In: Esposito, F., Ra\u015b, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS (LNAI), vol.\u00a04203, pp. 540\u2013549. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"59_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.artint.2004.01.006","volume":"162","author":"M. Cadoli","year":"2005","unstructured":"Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence\u00a0162(1-2), 89\u2013120 (2005)","journal-title":"Artificial Intelligence"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"59_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/11889205_12","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"Y. Dimopoulos","year":"2006","unstructured":"Dimopoulos, Y., Stergiou, K.: Propagation in CSP and SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 137\u2013151. Springer, Heidelberg (2006)"},{"key":"59_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"59_CR9","unstructured":"Frisch, A., Peugniez, T.: Solving non-boolean satisfiability problems with stochastic local search. In: Nebel, B. (ed.) IJCAI 2001, pp. 282\u2013290 (2001)"},{"key":"59_CR10","unstructured":"Van Gelder, A.: Another look at graph coloring via propositional satisfiability. In: Computational Symposium on Graph Coloring and its Generalizations (2002)"},{"key":"59_CR11","first-page":"180","volume-title":"Proc. of the 12th ECAI","author":"R. Genisson","year":"1996","unstructured":"Genisson, R., Jegou, P.: Davis and Putnam were already forward checking. In: Proc. of the 12th ECAI, pp. 180\u2013184. Wiley, Chichester (1996)"},{"key":"59_CR12","unstructured":"Gent, I.P.: Arc consistency in SAT. In: van Harmelen, F. (ed.) ECAI 2002 (2002)"},{"key":"59_CR13","unstructured":"Gray, F.: Pulse code communication, U. S. Patent 2 632 058 (March 1953)"},{"key":"59_CR14","first-page":"296","volume-title":"IJCAI 1999","author":"H. Hoos","year":"1999","unstructured":"Hoos, H.: SAT-encodings, search space structure, and local search performance. In: Dean, T. (ed.) IJCAI 1999, pp. 296\u2013303. Morgan Kaufmann, San Francisco (1999)"},{"key":"59_CR15","unstructured":"Iwama, K., Miyazaki, S.: SAT-variable complexity of hard combinatorial problems. In: IFIP World Computer Congress, North-Holland, pp. 253\u2013258 (1994)"},{"key":"59_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","volume":"45","author":"S. Kasif","year":"1990","unstructured":"Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence\u00a045, 275\u2013286 (1990)","journal-title":"Artificial Intelligence"},{"key":"59_CR17","first-page":"530","volume-title":"Proc. of DAC 2001","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of DAC 2001, pp. 530\u2013535. ACM Press, New York (2001)"},{"key":"59_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Prestwich","year":"2004","unstructured":"Prestwich, S.: Local search on SAT-encoded colouring problems. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919. Springer, Heidelberg (2004)"},{"issue":"1","key":"59_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00098-4","volume":"86","author":"N.M. Sadeh","year":"1996","unstructured":"Sadeh, N.M., Fox, M.S.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence\u00a086(1), 1\u201341 (1996)","journal-title":"Artificial Intelligence"},{"key":"59_CR20","unstructured":"Sinz, C.: The SAT race (2006), \n                    \n                      http:\/\/fmv.jku.at\/sat-race-2006\/"},{"issue":"1-2","key":"59_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B.M. Smith","year":"1996","unstructured":"Smith, B.M., Dyer, M.E.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence\u00a081(1-2), 155\u2013181 (1996)","journal-title":"Artificial Intelligence"},{"key":"59_CR22","unstructured":"van Dongen, M., Lecoutre, C., Roussel, O.: Second international competition of CSP and Max-CSP solvers (2006), \n                    \n                      http:\/\/www.cril.univ-artois.fr\/CPAI06\/"},{"key":"59_CR23","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","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:49:26Z","timestamp":1619520566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_59","relation":{},"subject":[]}}