{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:20:19Z","timestamp":1725747619000},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_50","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"678-693","source":"Crossref","is-referenced-by-count":1,"title":["Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Habet","sequence":"first","affiliation":[]},{"given":"Donia","family":"Toumi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-79719-7_3","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"G. Audemard","year":"2008","unstructured":"Audemard, G., Bordeaux, L., Hamadi, Y., Jabbour, S., Sais, L.: A Generalized Framework for Conflict Analysis. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 21\u201327. Springer, Heidelberg (2008)"},{"key":"50_CR2","unstructured":"Audemard, G., Simon, L.: Predicting Learnt Clauses Quality in Modern sat Solvers. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 399\u2013404 (2009)"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-33558-7_11","volume-title":"Principles and Practice of Constraint Programming","author":"G. Audemard","year":"2012","unstructured":"Audemard, G., Simon, L.: Refining Restarts Strategies for SAT and UNSAT. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 118\u2013126. Springer, Heidelberg (2012)"},{"issue":"7","key":"50_CR4","doi-asserted-by":"publisher","first-page":"394","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. Commun. ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective Preprocessing in SAT Through Variable and Clause Elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"50_CR7","unstructured":"Z. Fu, Y. Mahajan, S. Malik. New Features of the SAT\u201904 Version of zChaff. In SAT 2004 Competition. Solver Descriptions (2004)"},{"key":"50_CR8","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting Combinatorial Search Through Randomization. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 1998), pp. 431\u2013437. AAAI Press (1998)"},{"key":"50_CR9","unstructured":"Huang, J.: The Effect of Restarts on the Efficiency of Clause Learning. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2318\u20132323 (2007)"},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-33558-7_27","volume-title":"Principles and Practice of Constraint Programming","author":"G. Katsirelos","year":"2012","unstructured":"Katsirelos, G., Simon, L.: Eigenvector Centrality in Industrial SAT Instances. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 348\u2013356. Springer, Heidelberg (2012)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Annual ACM IEEE Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"issue":"5","key":"50_CR12","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P.M. Silva","year":"1999","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Trans. Computers\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Computers"},{"key":"50_CR13","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In: Proceedings of the 2001 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD 2001), pp. 279\u2013285. IEEE Press (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T12:16:24Z","timestamp":1548677784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}