{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T01:40:29Z","timestamp":1738374029304,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540878803"},{"type":"electronic","value":"9783540878810"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87881-0_5","type":"book-chapter","created":{"date-parts":[[2008,9,21]],"date-time":"2008-09-21T07:10:38Z","timestamp":1221981038000},"page":"38-50","source":"Crossref","is-referenced-by-count":1,"title":["A Study of SAT-Based Branching Heuristics for the CSP"],"prefix":"10.1007","author":[{"given":"Yannis","family":"Argyropoulos","sequence":"first","affiliation":[]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Regin, J.: Mac and Combined Heuristics: two Reasons to Forsake FC (and CBJ?) on Hard Problems, CP (1996)","DOI":"10.1007\/3-540-61551-2_66"},{"key":"5_CR2","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":"5_CR3","unstructured":"Buro, M., Kleine-Buning, H.: Report of a SAT competition, Technical Report, University of Paderborn (1992)"},{"key":"5_CR4","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Lakhdar, S.: Boosting systematic search by weighting contraints. In: ECAI (2004)"},{"issue":"7","key":"5_CR5","doi-asserted-by":"publisher","first-page":"393","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(7), 393\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"68","author":"R. Dechter","year":"1994","unstructured":"Dechter, R., Meiri, I.: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence\u00a068, 211\u2013241 (1994)","journal-title":"Artificial Intelligence"},{"key":"5_CR7","unstructured":"Freeman, J.W.: Improvements to propositional satisfiability search algorithms, Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania (1995)"},{"key":"5_CR8","unstructured":"Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: ECAI 1992, Vienna, Austria, pp. 31\u201335 (1992)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Grimes, D., Wallace, R.J.: Sampling Strategies and Variable Selection in Weighted Degree Heuristics, CP, pp. 831\u2013838 (2007)","DOI":"10.1007\/978-3-540-74970-7_61"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliot, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01531077","volume":"1","author":"R.J. Jeroslow","year":"1990","unstructured":"Jeroslow, R.J., Wang, J.: Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence\u00a01, 167\u2013188 (1990)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.3233\/SAT190010","volume":"1","author":"C. Lecoutre","year":"2007","unstructured":"Lecoutre, C., Sais, L., Vion, J.: Using SAT Encodings to Derive CSP Value Ordering Heuristics. Journal of Satisfiability, Boolean Modeling and Computation\u00a01, 169\u2013186 (2007)","journal-title":"Journal of Satisfiability, Boolean Modeling and Computation"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"Mackworth, A.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"5_CR14","unstructured":"Mali, A.: Puthan Veettil, Sandhya: Adapting SAT Heuristics to Solve Constraint Satisfaction Problems, Technical Report, University of Wisconsin (2001)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Marques\u2013 Silva, J.P., Sakallah, K.A.: GRASP - A new search algorithm for satisfiability. In: International Conference on Computer Aided Design (ICCAD), pp. 220\u2013227 (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"5_CR16","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, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"5_CR17","first-page":"155","volume-title":"A rearrangement search strategy for determining propositional satisfiability","author":"R. Zabih","year":"1988","unstructured":"Zabih, R., McAllester, D.A.: A rearrangement search strategy for determining propositional satisfiability, pp. 155\u2013160. AAAI, Menlo Park (1988)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence: Theories, Models and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87881-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T01:12:01Z","timestamp":1738372321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87881-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540878803","9783540878810"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87881-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}