{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:56:19Z","timestamp":1725566179304},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_50","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"690-705","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Strategies for (Weighted) Maximum Satisfiability"],"prefix":"10.1007","author":[{"given":"Zhao","family":"Xing","sequence":"first","affiliation":[]},{"given":"Weixiong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Alsinet, T., Manya, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Proc. SAT 2003 (2003)","key":"50_CR1"},{"issue":"4","key":"50_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009725216438","volume":"2","author":"B. Borchers","year":"1999","unstructured":"Borchers, B., Furman, J.: A two-phase exact algorithm for Max-SAT and weighted Max- SAT problems. J. Combinatorial Optimization\u00a02(4), 299\u2013306 (1999)","journal-title":"J. Combinatorial Optimization"},{"unstructured":"http:\/\/www.nmt.edu\/borchers\/maxsat.html","key":"50_CR3"},{"key":"50_CR4","doi-asserted-by":"crossref","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. CACM\u00a05, 394\u2013397 (1962)","journal-title":"CACM"},{"key":"50_CR5","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"unstructured":"Dixon, H., Ginsberg, M.L.: Inference methods for a pseudo-boolean satisfiability solver. In: Proc. AAAI 2002, pp. 635\u2013640","key":"50_CR6"},{"unstructured":"Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. PhD thesis, Univ. of Pennsylvania (1995)","key":"50_CR7"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E.C. Freuder","year":"1992","unstructured":"Freuder, E.C., Wallace, R.J.: Partial constraint satisfaction. Artificial Intelligence\u00a058, 21\u201370 (1992)","journal-title":"Artificial Intelligence"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-45193-8_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"S. Givry de","year":"2003","unstructured":"de Givry, S., Larrosa, J., Meseguer, P., Schiex, T.: Solving max-SAT as weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 363\u2013376. Springer, Heidelberg (2003)"},{"key":"50_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P. Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithm for the maximum satisfiability problem. Computing\u00a044, 279\u2013303 (1990)","journal-title":"Computing"},{"key":"50_CR11","volume-title":"Introduction to Operations Research","author":"F.S. Hillier","year":"2001","unstructured":"Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research. McGraw-Hill, New York (2001)"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01531074","volume":"1","author":"J.N. Hooker","year":"1990","unstructured":"Hooker, J.N., Fedjki, G.: Branch-and-cut solution of inference problems in prepositional logic. Annals of Math. and Artificial Intelligence\u00a01, 123\u2013139 (1990)","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF00881805","volume":"15","author":"J.N. Hooker","year":"1995","unstructured":"Hooker, J.N., Vinay, V.: Branching rules for satisfiability. J. Automated Reasoning\u00a015, 359\u2013383 (1995)","journal-title":"J. Automated Reasoning"},{"unstructured":"Hoos, H.H., Stuzle, T.: (1999), http:\/\/www.satlib.org","key":"50_CR14"},{"doi-asserted-by":"crossref","unstructured":"Joy, S., Mitchell, J., Borchers, B.: A branch and cut algorithm for Max-SAT and weighted Max-SAT. In: Du, D., Gu, J., Pardalos, P.M. (eds.) Satisfiability Problem: Theory and Applications, pp. 519\u2013536 (1997)","key":"50_CR15","DOI":"10.1090\/dimacs\/035\/13"},{"unstructured":"Li, C.M.: Anbulagan. Heuristics based on unit propagation for satisfiability problems. In: Proc. IJCAI 1997, pp. 366\u2013371 (1997)","key":"50_CR16"},{"key":"50_CR17","volume-title":"Introduction to Combinatorial Mathematics","author":"C.L. Liu","year":"1968","unstructured":"Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill, New York (1968)"},{"key":"50_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jagm.2000.1075","volume":"36","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. J. Algorithm\u00a036, 63\u201388 (2000)","journal-title":"J. Algorithm"},{"unstructured":"Park, J.D.: Using weighted max-sat engines to solve mpe. In: Proc. AAAI 2002, pp. 682\u2013687 (2002)","key":"50_CR19"},{"unstructured":"Selman, B.: Mwff: Program for generating random max k-SAT instances. Available from DIMACS","key":"50_CR20"},{"unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for local search. In: Proc. AAAI 1994, pp. 337\u2013343 (1994)","key":"50_CR21"},{"doi-asserted-by":"crossref","unstructured":"Wallace, R.J.: Enhancing maximum satisfiability algorithms with pure literal strategies. In: 11th Canadian Conf. on AI (1996)","key":"50_CR22","DOI":"10.1007\/3-540-61291-2_67"},{"doi-asserted-by":"crossref","unstructured":"Wallace, R.J., Freuder, E.C.: Comparative study of constraint satisfaction and davisputnam algorithms for maximum satisfiability problems. In: Johnson, D., Trick, M. (eds.) Cliques, Coloring, and Satisfiability, pp. 587\u2013615 (1996)","key":"50_CR23","DOI":"10.1090\/dimacs\/026\/28"},{"key":"50_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48369-1","volume-title":"Integer Optimization Local Search","author":"J.P. Walser","year":"1999","unstructured":"Walser, J.P.: Integer Optimization Local Search. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Zhang, H., Shen, H., Manya, F.: Exact algorithms for Max-SAT. In: Workshop on First- Order Theorem Proving (FTP 2003) (2003)","key":"50_CR25","DOI":"10.1016\/S1571-0661(04)80663-7"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:47:50Z","timestamp":1605761270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}