{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:16Z","timestamp":1725533896373},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_41","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"447-452","source":"Crossref","is-referenced-by-count":1,"title":["Relaxed DPLL Search for MaxSAT"],"prefix":"10.1007","author":[{"given":"Lukas","family":"Kroc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","series-title":"Frontiers in AI and Applications","volume-title":"Handbook of Satisfiability","year":"2009","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in AI and Applications, vol.\u00a0185. IOS Press, Amsterdam (2009)"},{"key":"41_CR2","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: MiniSat: A SAT solver with conflict-clause minimization. In: 8th SAT, St. Andrews, UK (June 2005)"},{"key":"41_CR3","unstructured":"Gerevini, A., Dimopoulos, Y., Haslum, P., Saetti, A. (Organizers): IPC-5 international planning competition (June 2006), http:\/\/zeus.ing.unibs.it\/ipc-5"},{"key":"41_CR4","unstructured":"Kautz, H.A., Selman, B.: BLACKBOX: A new approach to the application of theorem proving to problem solving. In: Workshop on Planning as Combinatorial Search, held in conjunction with AIPS 1998, Pittsburgh, PA (1998)"},{"key":"41_CR5","unstructured":"Kroc, L., Sabharwal, A., Gomes, C.P., Selman, B.: Integrating systematic and local search paradigms: A new strategy for MaxSAT. In: 21st IJCAI (July 2009)"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for Max-SAT. JAIR\u00a030 (2007)","DOI":"10.1613\/jair.2215"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Li, C.M., Wei, W., Zhang, H.: Combining adaptive noise and look-ahead in local search for SAT. In: 10th SAT, Lisbon, Portugal, May 2007, pp. 121\u2013133 (2007)","DOI":"10.1007\/978-3-540-72788-0_15"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Manquinho, V.M.: Towards more effective unsatisfiability-based maximum satisfiability algorithms. In: 11th SAT, May 2008, pp. 225\u2013230 (2008)","DOI":"10.1007\/978-3-540-79719-7_21"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: The Second DIMACS Implementation Challenge, pp. 521\u2013532 (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"41_CR10","unstructured":"Sinz, C. (Organizer).: SAT-race 2008 (May 2008)"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Tompkins, D.A.D., Hoos, H.H.: Scaling and probabilistic smoothing: Dynamic local search for unweighted MAX-SAT. In: 16th Canadian AI, pp. 145\u2013159 (2003)","DOI":"10.1007\/3-540-44886-1_13"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: An impl. and experim. env. for SLS algorithms for SAT and MAX-SAT. In: 7th SAT, Vancouver, BC (May 2004)","DOI":"10.1007\/11527695_24"}],"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_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T22:57:55Z","timestamp":1558393075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}