{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:14Z","timestamp":1725564614467},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153952"},{"type":"electronic","value":"9783642153969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15396-9_33","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T07:00:16Z","timestamp":1283756416000},"page":"398-413","source":"Crossref","is-referenced-by-count":2,"title":["Local Consistency and SAT-Solvers"],"prefix":"10.1007","author":[{"given":"Justyna","family":"Petke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Jeavons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"G12\/MiniZinc constraint solver. Software, http:\/\/www.g12.cs.mu.oz.au\/minizinc\/download.html"},{"key":"33_CR2","unstructured":"MiniSat solver. Software, http:\/\/minisat.se\/MiniSat.html"},{"key":"33_CR3","unstructured":"2nd internat. CSP solver competition, http:\/\/www.cril.univ-artois.fr\/CPAI06\/"},{"key":"33_CR4","unstructured":"3rd international CSP solver competition, http:\/\/cpai.ucc.ie\/08\/"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-02777-2_13","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"A. Atserias","year":"2009","unstructured":"Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 114\u2013127. Springer, Heidelberg (2009)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73420-8_26","volume-title":"Automata, Languages and Programming","author":"A. Atserias","year":"2007","unstructured":"Atserias, A., Bulatov, A.A., Dalmau, V.: On the power of k-consistency. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 279\u2013290. Springer, Heidelberg (2007)"},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jcss.2007.06.025","volume":"74","author":"A. Atserias","year":"2008","unstructured":"Atserias, A., Dalmau, V.: A combinatorial characterization of resolution width. Journal of Computer and Systems Science\u00a074(3), 323\u2013334 (2008)","journal-title":"Journal of Computer and Systems Science"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F. Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC Via Unit Propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 133\u2013147. Springer, Heidelberg (2007)"},{"key":"33_CR9","first-page":"595","volume-title":"Proceedings of FOCS 2009","author":"L. Barto","year":"2009","unstructured":"Barto, L., Kozik, M.: Constraint satisfaction problems of bounded width. In: Proceedings of FOCS 2009, pp. 595\u2013603. IEEE Computer Society, Los Alamitos (2009)"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1613\/jair.1410","volume":"22","author":"P. Beame","year":"2004","unstructured":"Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research\u00a022, 319\u2013351 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S1574-6526(06)80007-6","volume-title":"Handbook of Constraint Programming, ch. 3","author":"C. Bessi\u00e9re","year":"2006","unstructured":"Bessi\u00e9re, C.: Constraint propagation. In: Handbook of Constraint Programming, ch. 3, pp. 29\u201383. Elsevier, Amsterdam (2006)"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional satisfiability and constraint programming: A comparative survey. ACM Computing Surveys\u00a038(4) (2006)","DOI":"10.1145\/1177352.1177354"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(89)90080-5","volume":"41","author":"M.C. Cooper","year":"1989","unstructured":"Cooper, M.C.: An optimal k-consistency algorithm. Artificial Intelligence\u00a041, 89\u201395 (1989)","journal-title":"Artificial Intelligence"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(94)90021-3","volume":"65","author":"M.C. Cooper","year":"1994","unstructured":"Cooper, M.C., Cohen, D.A., Jeavons, P.G.: Characterising tractable constraints. Artificial Intelligence\u00a065, 347\u2013361 (1994)","journal-title":"Artificial Intelligence"},{"key":"33_CR15","unstructured":"Deville, Y., Barette, O., van Hentenryck, P.: Constraint satisfaction over connected row convex constraints. In: Proceeedings of IJCAI 1997, pp. 405\u2013411 (1997)"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E.C. Freuder","year":"1978","unstructured":"Freuder, E.C.: Synthesizing constraint expressions. ACM Comm.\u00a021, 958\u2013966 (1978)","journal-title":"ACM Comm."},{"key":"33_CR17","first-page":"98","volume-title":"Proceeedings of ECAI 2006","author":"I. Gent","year":"2006","unstructured":"Gent, I., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: Proceeedings of ECAI 2006, pp. 98\u2013102. IOS Press, Amsterdam (2006)"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/11564751_27","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"J. Hwang","year":"2005","unstructured":"Hwang, J., Mitchell, D.: 2-way vs. d-way branching for CSP. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 343\u2013357. Springer, Heidelberg (2005)"},{"issue":"1\/2","key":"33_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1006303512524","volume":"24","author":"I. Rish","year":"2000","unstructured":"Rish, I., Dechter, R.: Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning\u00a024(1\/2), 225\u2013275 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"33_CR20","unstructured":"Kolaitis, P.G., Vardi, M.Y.: A game-theoretic approach to constraint satisfaction. In: Proceedings of AAAI 2000, pp. 175\u2013181 (2000)"},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: International Design Automation Conference, DAC, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"33_CR24","unstructured":"Petke, J., Jeavons, P.G.: Tractable benchmarks for constraint programming. Technical Report RR-09-07, Computing Laboratory, University of Oxford (2009)"},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-04244-7_51","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"K. Pipatsrisawat","year":"2009","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers with restarts. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 654\u2013668. Springer, Heidelberg (2009)"},{"key":"33_CR26","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)"},{"issue":"2","key":"33_CR27","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N. Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints\u00a014(2), 254\u2013272 (2009)","journal-title":"Constraints"},{"key":"33_CR28","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Andmalik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: Proceedings of the International Conference on Computer-Aided Design (ICCAD 2001), pp. 279\u2013285 (2001)"},{"key":"33_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/3-540-45657-0_2","volume-title":"Computer Aided Verification","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: The quest for efficient Boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 641\u2013653. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15396-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:06:59Z","timestamp":1606187219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15396-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153952","9783642153969"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15396-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}