{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:08:29Z","timestamp":1746072509344,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381706"},{"type":"electronic","value":"9783642381713"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_1","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"1-11","source":"Crossref","is-referenced-by-count":2,"title":["Stronger Inference through Implied Literals from Conflicts and Knapsack Covers"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Achterberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Samulowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optimization\u00a04(1), 4\u201320 (2007); Special issue: Mixed Integer Programming","journal-title":"Discrete Optimization"},{"key":"1_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (July 2007)"},{"key":"1_CR3","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: 21st IJCAI, Pasadena, CA, pp. 399\u2013404 (July 2009)"},{"key":"1_CR4","unstructured":"Bacchus, F., Biere, A., Heule, M.: Personal Communication (2012)"},{"key":"1_CR5","unstructured":"Freeman, J.: Improvements to Propositional Satisfiability Search Algorithms. PhD thesis, University of Pennsylvania (1995)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-21581-0_17","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"M.J.H. Heule","year":"2011","unstructured":"Heule, M.J.H., J\u00e4rvisalo, M., Biere, A.: Efficient CNF simplification based on binary implication graphs. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 201\u2013215. Springer, Heidelberg (2011)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T. Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Mathematical Programming Computation\u00a03, 103\u2013163 (2011)","journal-title":"Mathematical Programming Computation"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Lynce, I., Marques-Silva, J.: Probing-based preprocessing techniques for propositional satisfiability. In: 15th ICTAI, Sacramento, CA, pp. 105\u2013111 (November 2003)","DOI":"10.1109\/TAI.2003.1250177"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions of Computers\u00a048, 506\u2013521 (1999)","journal-title":"IEEE Transactions of Computers"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-31612-8_54","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"A. Matsliah","year":"2012","unstructured":"Matsliah, A., Sabharwal, A., Samulowitz, H.: Augmenting clause learning with implied literals. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol.\u00a07317, pp. 500\u2013501. Springer, Heidelberg (2012)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing\u00a06, 445\u2013454 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"1_CR12","unstructured":"Soos, M.: CryptoMiniSat 2.9.x (2011), http:\/\/www.msoos.org\/cryptominisat2"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38171-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:07:24Z","timestamp":1745986044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}