{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T06:19:34Z","timestamp":1738217974759,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797180"},{"type":"electronic","value":"9783540797197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79719-7_17","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"168-181","source":"Crossref","is-referenced-by-count":4,"title":["Improvements to Hybrid Incremental SAT Algorithms"],"prefix":"10.1007","author":[{"given":"Florian","family":"Letombe","sequence":"first","affiliation":[]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Babi\u0107, D., Hu, A.J.: Structural Abstraction of Software Verification Conditions. Computer-Aided Verification, 371\u2013383 (2007)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. Tools and Algorithms for the Construction and Analysis of Systems, 193\u2013207 (1999)","DOI":"10.21236\/ADA360973"},{"key":"17_CR3","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, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Een, N., S\u00f6rensson, N.: An extensible SAT solver. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 502\u2013518 (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Fang, L., Hsiao, M.S.: A new hybrid solution to boost SAT solver performance. In: Design, Automation and Testing in Europe Conference, pp. 1307\u20131313 (2007)","DOI":"10.1109\/DATE.2007.364478"},{"key":"17_CR6","unstructured":"Fang, L., Hsiao, M.S.: Private communications (2007)"},{"key":"17_CR7","unstructured":"Ferris, B., Froehlich, J.: WalkSAT as an Informed Heuristic to DPLL in SAT Solving. Technical report, CSE 573: Artificial Intelligence (2004)"},{"key":"17_CR8","unstructured":"Gent, I.P., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: National Conference on Artificial Intelligence, pp. 28\u201333 (1993)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: a fast and robust SAT-solver. In: Design, Automation and Testing in Europe Conference, pp. 142\u2013149 (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"17_CR10","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: National Conference on Artificial Intelligence, pp. 431\u2013437 (1998)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Habet, D., Li, C.M., Devendeville, L., Vasquez, M.: A hybrid approach for SAT. In: International Conference on Principles and Practice of Constraint Programming, pp. 172\u2013184 (2002)","DOI":"10.1007\/3-540-46135-3_12"},{"key":"17_CR12","unstructured":"Hoos, H.: An adaptive noise mechanism for WalkSAT. In: National Conference on Artificial Intelligence, pp. 655\u2013660 (2002)"},{"key":"17_CR13","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H. Hoos","year":"2004","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco (2004)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1162\/evco.2006.14.2.223","volume":"14","author":"F. Lardeux","year":"2006","unstructured":"Lardeux, F., Saubion, F., Hao, J.-K.: GASAT: A genetic local search algorithm for the satisfiability problem. Evolutionary Computation\u00a014(2), 223\u2013253 (2006)","journal-title":"Evolutionary Computation"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Li, C.M., Huang, W.Q., Zhang, H.: Combining adaptive noise and look-ahead in local search for SAT. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 121\u2013133 (2007)","DOI":"10.1007\/978-3-540-72788-0_15"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Manolios, P., Srinivasan, S.K.: A parameterized benchmark suite of hard pipelined-machine-verification problems. In: Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pp. 363\u2013366 (2005)","DOI":"10.1007\/11560548_32"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Sakallah, K.: GRASP: A new search algorithm for satisfiability. In: International Conference on Computer-Aided Design, pp. 220\u2013227 (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"issue":"3-4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B. Mazure","year":"1998","unstructured":"Mazure, B., Sais, L., Gr\u00e9goire, E.: Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence\u00a022(3-4), 319\u2013331 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"17_CR19","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence of invariants in local search. In: National Conference on Artificial Intelligence, pp. 321\u2013326 (1997)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Applying SAT methods in unbounded symbolic model checking. Computer-Aided Verification, 250\u2013264 (2002)","DOI":"10.1007\/3-540-45657-0_19"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Engineering an efficient SAT solver. In: Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Prestwich, S., Lynce, I.: Local search for unsatisfiability. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 283\u2013296 (2006)","DOI":"10.1007\/11814948_28"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Ravi, K., Somenzi, F.: Minimal assignments for bounded model checking. Tools and Algorithms for the Construction and Analysis of Systems, 31\u201345 (2004)","DOI":"10.1007\/978-3-540-24730-2_3"},{"key":"17_CR24","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: National Conference on Artificial Intelligence, pp. 337\u2013343 (1994)"},{"key":"17_CR25","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: National Conference on Artificial Intelligence, pp. 440\u2013446 (1992)"},{"key":"17_CR26","unstructured":"Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: National Conference on Artificial Intelligence, pp. 191\u2013196 (2004)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Velev, M.N.: Using rewriting rules and positive equality to formally verify wide-issue out-of-order microprocessors with a reorder buffer. In: Design, Automation and Testing in Europe Conference, pp. 28\u201335 (2002)","DOI":"10.1109\/DATE.2002.998246"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla-07: The design and analysis of an algorithm portfolio for SAT. In: International Conference on Principles and Practice of Constraint Programming, pp. 712\u2013727 (2007)","DOI":"10.1007\/978-3-540-74970-7_50"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Zarpas, E.: Benchmarking SAT solvers for bounded model checking. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 340\u2013354 (2005)","DOI":"10.1007\/11499107_25"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79719-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T02:37:57Z","timestamp":1738204677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797180","9783540797197"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_17","relation":{},"subject":[]}}