{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:47:30Z","timestamp":1743104850793,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247682"},{"type":"electronic","value":"9783642247699"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24769-9_49","type":"book-chapter","created":{"date-parts":[[2011,10,10]],"date-time":"2011-10-10T15:13:38Z","timestamp":1318259618000},"page":"679-689","source":"Crossref","is-referenced-by-count":0,"title":["Domain-Splitting Generalized Nogoods from Restarts"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Baptista","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Azevedo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R.: Principles of constraint programming. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511615320"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1177352.1177354","volume":"38","author":"L. Bordeaux","year":"2006","unstructured":"Bordeaux, L., Hamadi, Y., Zhang, L.: Propositional Satisfiability and Constraint Programming: A comparative survey. ACM Comput. Surv.\u00a038, 12 (2006)","journal-title":"ACM Comput. Surv."},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Lecoutre, C.: Constraint Networks: Techniques and Algorithms. Wiley-ISTE (2009)","DOI":"10.1002\/9780470611821"},{"key":"49_CR4","first-page":"131","volume-title":"Proceedings of the 20th International Joint Conference on Artifical Intelligence","author":"C. Lecoutre","year":"2007","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood recording from restarts. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, pp. 131\u2013136. Morgan Kaufmann Publishers Inc., Hyderabad (2007)"},{"key":"49_CR5","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall (2002)"},{"key":"49_CR6","unstructured":"Dincbas, M., Hentenryck, P.V., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The Constraint Logic Programming Language CHIP. In: FGCS 1988, pp. 693\u2013702 (1988)"},{"key":"49_CR7","unstructured":"Balafoutis, T., Paparrizou, A., Stergiou, K.: Experimental Evaluation of Branching Schemes for the CSP. 1009.0407 (2010)"},{"key":"49_CR8","first-page":"431","volume-title":"Proceedings of the Fifteenth National Conference on Artificial Intelligence","author":"C.P. Gomes","year":"1998","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 431\u2013437. American Association for Artificial Intelligence, Madison (1998)"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Gomes, C., Selman, B., Crato, N.: Heavy-Tailed Distributions in Combinatorial Search. Principles and Practices of Constraint Programming, 121\u2013135 (1997)","DOI":"10.1007\/BFb0017434"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C.P. Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. Journal of Automated Reasoning\u00a024, 67\u2013100 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"49_CR11","unstructured":"Walsh, T.: Search in a Small World. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 1172\u20131177. Morgan Kaufmann Publishers Inc. (1999)"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/3-540-45349-0_36","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"L. Baptista","year":"2000","unstructured":"Baptista, L., Marques-Silva, J.: Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 489\u2013494. Springer, Heidelberg (2000)"},{"key":"49_CR13","unstructured":"Baptista, L., Lynce, I., Marques-Silva, J.: Complete Search Restart Strategies for Satisfiability. In: IJCAI Workshop on Stochastic Search Algorithms, IJCAI-SSA (2001)"},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.3233\/SAT190009","volume":"1","author":"C. Lecoutre","year":"2007","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Recording and Minimizing Nogoods from Restarts. Journal on Satisfiability, Boolean Modeling and Computation\u00a01, 147\u2013167 (2007)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R. Dechter","year":"1990","unstructured":"Dechter, R.: Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. Artif. Intell.\u00a041, 273\u2013312 (1990)","journal-title":"Artif. Intell."},{"key":"49_CR16","first-page":"530","volume-title":"Proceedings of the 38th Annual Design Automation Conference","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: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535. ACM, Las Vegas (2001)"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Bacchus, F.: Unrestricted Nogood Recording in CSP Search. CP. pp. 873\u2013877 (2003)","DOI":"10.1007\/978-3-540-45193-8_70"},{"key":"49_CR18","unstructured":"Katsirelos, G., Bacchus, F.: Generalized NoGoods in CSPs, pp. 390\u2013396. AAAI (2005)"},{"key":"49_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T. Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 352\u2013366. Springer, Heidelberg (2009)"},{"key":"49_CR20","unstructured":"Kitching, M., Bacchus, F.: Set Branching in Constraint Optimization. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 532\u2013537 (2009)"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24769-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T19:57:57Z","timestamp":1593115077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24769-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247682","9783642247699"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24769-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}