{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T14:54:56Z","timestamp":1791125696955,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001973","type":"print"},{"value":"9783540361879","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36187-1_53","type":"book-chapter","created":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T01:17:37Z","timestamp":1196212657000},"page":"603-614","source":"Crossref","is-referenced-by-count":6,"title":["A Two Level Local Search for MAX-SAT Problems with Hard and Soft Constraints"],"prefix":"10.1007","author":[{"given":"John","family":"Thornton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stuart","family":"Bain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duc Nghia","family":"Pham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"issue":"2","key":"53_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"U. Bistarelli","year":"1997","unstructured":"U. Bistarelli, S. Montanari and F. Rossi. Semiring-based constraint solving and optimization. Journal of ACM, 44(2):201\u2013236, 1997.","journal-title":"Journal of ACM"},{"issue":"3","key":"53_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01807506","volume":"5","author":"A. Borning","year":"1992","unstructured":"A. Borning, B. Freeman-Benson, and M. Wilson. Constraint hierarchies. Lisp and Symbolic Computation, 5(3):223\u2013270, 1992.","journal-title":"Lisp and Symbolic Computation"},{"key":"53_CR3","unstructured":"B. Cha, K. Iwama, Y. Kambayashi, and S. Miyazaki. Local search algorithms for partial MAX-SAT. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pages 332\u2013337, 1997."},{"key":"53_CR4","unstructured":"J. Frank. Learning short term weights for GSAT. In Proceedings of theF ourteenth National Conference on Artificial Intelligence (AAAI-97), pages 384\u2013389, 1997."},{"issue":"1","key":"53_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E. Freuder","year":"1992","unstructured":"E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1):21\u201370, 1992.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"53_CR6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover. Tabu search: Part 1. ORSA Journal on Computing, 1(3):190\u2013206, 1989.","journal-title":"ORSA Journal on Computing"},{"key":"53_CR7","unstructured":"M. Heinz, L. Fong, L. Chong, S. Ping, J. Walser, and R. Yap. Solving hierarchical constraints over finite domains. In Proceedings of theSixth International Symposium on Artificial Intelligence and Mathematics, 2000."},{"key":"53_CR8","unstructured":"H. Hoos. On the run-time behavior of stochastic local search algorithms for SAT. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), pages 661\u2013666, 1999."},{"key":"53_CR9","unstructured":"H. Jiang, Y. Kautz and B. Selman. Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. In First International Joint Workshop on Artificial Intelligence and Operations Research, 1995."},{"key":"53_CR10","unstructured":"D. McAllester, B. Selman, and H. Kautz. Evidence for invariance in local search. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pages 321\u2013326, 1997."},{"key":"53_CR11","unstructured":"P. Mills and E. Tsang. Guided local search applied to the satisfiability (SAT) problem. In Proceedings of the15th National Conferenceof theA ustralian Society for Operations Research (ASOR\u201999), pages 872\u2013883, 1999."},{"key":"53_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1006343127545","volume":"24","author":"P. Mills","year":"2000","unstructured":"P. Mills and E. Tsang. Guided local search for solving SAT and weighted MAXSAT problems. Journal of Automated Reasoning, 24:205\u2013223, 2000.","journal-title":"Journal of Automated Reasoning"},{"key":"53_CR13","unstructured":"P. Morris. The Breakout method for escaping local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 40\u201345, 1993."},{"key":"53_CR14","unstructured":"A. Schaerf. Tabu search for large high school timetabling problems. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 363\u2013368, 1996."},{"key":"53_CR15","unstructured":"D. Schuurmans and F. Southey. Local search characteristics of incomplete SAT procedures. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), pages 297-302, 2000."},{"key":"53_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008287028851","volume":"12","author":"Y. Shang","year":"1998","unstructured":"Y. Shang and B. Wah. A discrete Lagrangian-based global search method for solving satisfiability problems. J. Global Optimization, 12:61\u201399, 1998.","journal-title":"J. Global Optimization"},{"key":"53_CR17","doi-asserted-by":"crossref","unstructured":"J. Thornton, W. Pullan, and J. Terry. Towards fewer parameters for SAT clause weighting algorithms. In Proceedings of the Fifteenth Australian Joint Conference on Artificial Intelligence (AI\u20192002), To appear, 2002.","DOI":"10.1007\/3-540-36187-1_50"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"J. Thornton and A. Sattar. Dynamic constraint weighting for over-constrained problems. In Proceedings of the Fifth Pacific Rim Conference on Artificial Intelligence (PRICAI-98), pages 377\u2013388, 1998.","DOI":"10.1007\/BFb0095285"},{"key":"53_CR19","unstructured":"Wu Z. TheThe ory and Applications of DiscreteConstr ained Optimization using LagrangeMultiplie rs. PhD thesis, Department of Computer Science, University of Illinois, 2000."}],"container-title":["Lecture Notes in Computer Science","AI 2002: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36187-1_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T23:19:24Z","timestamp":1551136764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36187-1_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001973","9783540361879"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36187-1_53","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}