{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:19:56Z","timestamp":1737523196005,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"},{"type":"electronic","value":"9783540749707"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74970-7_18","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"225-240","source":"Crossref","is-referenced-by-count":6,"title":["On Inconsistent Clause-Subsets for Max-SAT Solving"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Darras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Dequen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laure","family":"Devendeville","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu-Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Watson, J., Beck, J., Howe, A., Whitley, L.: Toward an understanding of local search cost in job-shop scheduling (2001)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Iwama, K., Kambayashi, Y., Miyano, E.: New bounds for oblivious mesh routing. In: European Symposium on Algorithms, pp. 295\u2013306 (1998)","DOI":"10.1007\/3-540-68530-8_25"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zha, H., Chao-Hsien, C., Ji, X., Chen, X.: Towards inferring protein interactions: Challenges and solutions. EURASIP Journal on Applied Signal Processing (2005)","DOI":"10.1155\/ASP\/2006\/37349"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for max-sat. Journal of Artificial Intelligence Research (to appear, 2007)","DOI":"10.1613\/jair.2215"},{"key":"18_CR5","unstructured":"Heras, F., Larrosa, J.: New inference rules for efficient max-sat solving. In: AAAI (2006)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Lin, H., Su, K.: Exploiting inference rules to compute lower bounds for max-sat solving. In: IJCAI 2007 (2007)","DOI":"10.1613\/jair.2215"},{"issue":"1-2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.artint.2005.01.004","volume":"164","author":"Z. Xing","year":"2005","unstructured":"Xing, Z., Zhang, W.: Maxsolver: an efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence\u00a0164(1-2), 47\u201380 (2005)","journal-title":"Artificial Intelligence"},{"key":"18_CR8","unstructured":"Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted csp. In: IJCAI, pp. 239\u2013244 (2003)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/11564751_31","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C.M. Li","year":"2005","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 403\u2013414. Springer, Heidelberg (2005)"},{"key":"18_CR10","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat. In: AAAI, pp. 86\u201391 (2006)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Wallace, R., Freuder, E.: Comparative studies of constraint satisfaction and davis-putnam algorithms for maximum satisfiability problems. In: Cliques, Colouring and Satisfiability, pp. 587\u2013615 (1996)","DOI":"10.1090\/dimacs\/026\/28"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-59479-5_22","volume-title":"Constraint Processing, Selected Papers","author":"R.J. Wallace","year":"1995","unstructured":"Wallace, R.J.: Directed arc consistency preprocessing. In: Constraint Processing, Selected Papers, pp. 121\u2013137. Springer, London, UK (1995)"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0004-3702(98)00108-8","volume":"107","author":"J. Larrosa","year":"1999","unstructured":"Larrosa, J., Meseguer, P., Schiex, T.: Maintaining reversible dac for max-csp. Artif. Intell.\u00a0107(1), 149\u2013163 (1999)","journal-title":"Artif. Intell."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR15","unstructured":"Shen, H., Zhang, H.: Study of lower bounds functions for max-2-sat. In: AAAI 2004, pp. 185\u2013190 (2004)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/11499107_27","volume-title":"Theory and Applications of Satisfiability Testing","author":"T. Alsinet","year":"2005","unstructured":"Alsinet, T., Many\u00e0, F., Planes, J.: Improved exact solver for weighted Max-SAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 371\u2013377. Springer, Heidelberg (2005)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"S. Givry de","year":"2004","unstructured":"de Givry, S.: Singleton consistency and dominance for weighted csp. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258. Springer, Heidelberg (2004)"},{"key":"18_CR18","unstructured":"Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted csp. In: IJCAI 2003 (2003)"},{"issue":"1-2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.artint.2005.01.004","volume":"164","author":"Z. Xing","year":"2005","unstructured":"Xing, Z., Zhang, W.: Maxsolver: an efficient exact algorithm for (weighted) maximum satisfiability. Artif. Intell.\u00a0164(1-2), 47\u201380 (2005)","journal-title":"Artif. Intell."},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-48242-3_3","volume-title":"Logic Programming and Automated Reasoning","author":"R. B\u00e9jar","year":"1999","unstructured":"B\u00e9jar, R., Many\u00e0, F.: Solving combinatorial problems with regular local search algorithms. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol.\u00a01705, pp. 33\u201343. Springer, Heidelberg (1999)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"B\u00e9jar, R., H\u00e4hnle, R., Many\u00e0, F.: A modular reduction of regular logic to classical logic. In: ISMVL 2001, pp. 221\u2013226 (2001)","DOI":"10.1109\/ISMVL.2001.924576"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Ans\u00f3tegui","year":"2005","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F.: Mapping problems with finite-domain variables into problems with boolean variables. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 1\u201315. Springer, Heidelberg (2005)"},{"issue":"4\u20135","key":"18_CR23","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10732-006-7234-9","volume":"12","author":"J. Argelich","year":"2006","unstructured":"Argelich, J., Many\u00e0, F.: Exact Max-SAT solvers for over-constrained problems. Journal of Heuristics\u00a012(4\u20135), 375\u2013392 (2006)","journal-title":"Journal of Heuristics"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T14:28:36Z","timestamp":1737469716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540749691","9783540749707"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}