{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:31:41Z","timestamp":1761597101293},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Comput. Sci. & Technol."],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1007\/bf02947312","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T08:41:25Z","timestamp":1221208885000},"page":"340-346","source":"Crossref","is-referenced-by-count":9,"title":["An algorithm based on tabu search for satisfiability problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Wenqi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Defu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houxiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"BF02947312_CR1","first-page":"1","volume":"26","author":"Li Wei","year":"1999","unstructured":"Li Wei, Huang Xiong. The analysis of algorithms for the proposition logic satisfiability.Computer Science, 1999, 26(3): 1\u20139.","journal-title":"Computer Science"},{"key":"BF02947312_CR2","unstructured":"Gent I P, Walsh T. The search for satisfaction. http:\/\/dream.dai.ed.ac.uk\/group\/tw\/sat\/, 1999."},{"key":"BF02947312_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis M, Putnam H. A computing procedure for quantification theory.Journal of the ACM, 1960, 7: 201\u2013215.","journal-title":"Journal of the ACM"},{"key":"BF02947312_CR4","unstructured":"Selman B, Levesque H, Mitchell D. A new method for solving hard satisfiability problems. InProceedings of the 10th National Conference on AI, American Association for Artificial Intelligence, 1992, pp. 440\u2013446."},{"issue":"1","key":"BF02947312_CR5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/130836.130837","volume":"3","author":"J Gu","year":"1992","unstructured":"Gu J. Efficient local search for very large-scale satisfiability problems.SIGART Bulletin, 1992, 3(1): 8\u201312.","journal-title":"SIGART Bulletin"},{"key":"BF02947312_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.7","volume":"1","author":"I P Gent","year":"1993","unstructured":"Gent I P, Walsh T. An empirical analysis of search in GSAT.Journal of Artificial Intelligence Research, 1993, 1: 47\u201359.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"11","key":"BF02947312_CR7","first-page":"1208","volume":"24","author":"Li Wei","year":"1994","unstructured":"Li Wei, Huang Wenqi. A physic-mathematical method for solving conjunctive normal form satisfiability problem.Science in China (Series A), 1994, 24(11): 1208\u20131217.","journal-title":"Science in China (Series A)"},{"key":"BF02947312_CR8","unstructured":"Selman B, Kautz H, Cohen B. Noise strategies for improving local search. InProceedings of the 12th National Conference on AI American Association for Artificial, Intelligence, 1994, pp. 337\u2013343."},{"key":"BF02947312_CR9","doi-asserted-by":"crossref","unstructured":"Spears W M. Simulated annealing for hard satisfiability problems. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson D S, Trick M A (eds.), 1996, pp. 533\u2013558.DIMA CS Series in Discrete Mathematics and Theoretical Computer Science, Volume 26, American Mathematical Society.","DOI":"10.1090\/dimacs\/026\/26"},{"key":"BF02947312_CR10","unstructured":"Mazure B, Sais L, Gregoire E. Tabu search for SAT. InProceedings of 14th National Conference on Artificial Intelligence, American Association for Artificial Intelligence, AAAI Press\/The MIT Press, 1997, pp. 281\u2013285."},{"issue":"2","key":"BF02947312_CR11","first-page":"179","volume":"27","author":"Huang Wenqi","year":"1997","unstructured":"Huang Wenqi, Jin Renchao. The quasi-physical personification algorithm for solving SAT problem-Solar.Science in China (Series E), 1997, 27(2): 179\u2013186.","journal-title":"Science in China (Series E)"},{"key":"BF02947312_CR12","unstructured":"McAllester D, Selman B, Kautz H. Evidence for invariants in local search. InProceedings of the 14th National Conference on AI American Association for Artificial Intelligence, 1997, pp. 321\u2013327."},{"key":"BF02947312_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M. Tabu Search. Kluwer Academic Publishers, Boston, 1997."},{"issue":"1\/2","key":"BF02947312_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"Holger H Hoos","year":"1999","unstructured":"Holger H Hoos, Thomas St\u00fctzle. Towards a characterisation of the behavior of stochastic local search algorithms for SAT.Artificial Intelligence, 1999, 112(1\/2): 213\u2013232.","journal-title":"Artificial Intelligence"},{"key":"BF02947312_CR15","unstructured":"Mitchell D, Selman B, Levesque H J. Hard and easy distributions of SAT problems. InProc. AAAI-92, San Jose, CA, 1992, pp. 459\u2013465."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02947312.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02947312\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02947312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:17:18Z","timestamp":1558469838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02947312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["BF02947312"],"URL":"https:\/\/doi.org\/10.1007\/bf02947312","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}