{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:24Z","timestamp":1725533904787},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_28","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"284-297","source":"Crossref","is-referenced-by-count":8,"title":["A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Balint","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Henn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Gableske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.: The Complexity of Theorem-Proving Procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, vol.\u00a01, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"28_CR2","unstructured":"Crawford, J.M.: Solving satisfiability problems using a combination of systematic and local search. In: Second DIMACS Challenge, Rutgers University, NJ (1993)"},{"key":"28_CR3","unstructured":"The bwGRiD, http:\/\/www.bw-grid.de\/"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"28_CR5","unstructured":"Ferris, B., Fr\u00f6hlich, J.: WalkSAT as an Informed Heuristic to DPLL in SAT Solving. Technical report, CSE 573: Artificial Intelligence (2004)"},{"key":"28_CR6","unstructured":"Fang, H., Ruml, W.: Complete Local Search for Propositional Satisfiability. In: Association for the Advancement of Artificial Intelligence (AAAI 2004), pp. 161\u2013166 (2004)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Fang, L., Hsiao, M.: A New Hybrid Solution to Boost SAT Solver Performance. In: Design, Automation, and Test in Europe, pp. 1307\u20131313 (2007)","DOI":"10.1109\/DATE.2007.364478"},{"key":"28_CR8","unstructured":"Gableske, O.: Towards the Development of a Hybrid SAT Solver. Diploma Thesis, University of Ulm, Germany (January 2009), http:\/\/www.uni-ulm.de\/fileadmin\/website_uni_ulm\/iui.inst.190\/Mitarbeiter\/gableske\/DA.pdf"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-46135-3_12","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"D. Habet","year":"2002","unstructured":"Habet, D., Li, C.M., Devendeville, L., Vasquez, M.: A Hybrid Approach for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 172\u2013184. Springer, Heidelberg (2002)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-24840-8_18","volume-title":"Advances in Artificial Intelligence","author":"W. Havens","year":"2004","unstructured":"Havens, W., Dilkina, B.: A Hybrid Schema for Systematic Local Search. In: Tawfik, A.Y., Goodwin, S.D. (eds.) Canadian AI 2004. LNCS, vol.\u00a03060, pp. 248\u2013260. Springer, Heidelberg (2004)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-72788-0_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"M. Heule","year":"2007","unstructured":"Heule, M., van Maaren, H.: Effective incorporation of Double Look-Ahead Procedures. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 258\u2013271. Springer, Heidelberg (2007)"},{"key":"28_CR12","unstructured":"Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635\u2013660 (2002)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F. Hutter","year":"2002","unstructured":"Hutter, F., Tompkins, D.A., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 233\u2013248. Springer, Heidelberg (2002)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Jussien, N., Lhomme, O.: Local Search With Constraint Propagation and Conflict-Based Heuristics. In: 7th National Conference on Artificial Intelligence, pp. 169\u2013174 (2002)","DOI":"10.1016\/S0004-3702(02)00221-7"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-79719-7_17","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"F. Letombe","year":"2008","unstructured":"Letombe, F., Marques-Silva, J.: Improvements to hybrid incremental SAT algorithms. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 168\u2013181. Springer, Heidelberg (2008)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11499107_12","volume-title":"Theory and Applications of Satisfiability Testing","author":"C.M. Li","year":"2005","unstructured":"Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 158\u2013172. Springer, Heidelberg (2005)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B. Mazure","year":"1998","unstructured":"Mazure, B., Sais, L., Gregoire, E.: Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence\u00a022, 319\u2013331 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Pham, D.N., Thornton, J.R., Gretton, C., Sattar, A.: Advances in Local Search for Satisfiability. In: Australian Conference on Artificial Intelligence 2007, pp. 213\u2013222 (2007)","DOI":"10.1007\/978-3-540-76928-6_23"},{"key":"28_CR19","first-page":"440","volume-title":"Proceedings of the Tenth National Conference on Artificial Intelligence","author":"B. Selman","year":"1992","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 440\u2013446. AAAI Press, Menlo Park (1992)"},{"key":"28_CR20","unstructured":"The SAT Competition Homepage, http:\/\/www.satcompetition.org"},{"key":"28_CR21","unstructured":"The SATLIB Benchmark problems, http:\/\/www.cs.ubc.ca\/~hoos\/SATLIB"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Wu, Q., Hsiao, M.S.: A New Simulation-Based Property Checking Algorithm Based on Partitioned Alternative Search Space Traversal. IEEE Transactions on Computers\u00a055(11) (2006)","DOI":"10.1109\/TC.2006.170"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.04.001","volume":"158","author":"W. Zhang","year":"2004","unstructured":"Zhang, W.: Configuration landscape analysis and backbone local search. Part I: Satisfiability and maximum satisfiability. Artificial Intelligence\u00a0158, 1\u201326 (2004)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T22:58:02Z","timestamp":1558393082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}