{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T21:35:20Z","timestamp":1771796120779,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4284,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0004-3702(01)00151-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:51:33Z","timestamp":1027615893000},"page":"121-150","source":"Crossref","is-referenced-by-count":43,"title":["Local search characteristics of incomplete SAT procedures"],"prefix":"10.1016","volume":"132","author":[{"given":"Dale","family":"Schuurmans","sequence":"first","affiliation":[]},{"given":"Finnegan","family":"Southey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00151-5_BIB001","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"256","article-title":"Generating satisfiable problem instances","author":"Achlioptas","year":"2000"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB002","series-title":"Proc. AAAI-97, Providence, RI","first-page":"203","article-title":"Using CSP look-back techniques to solve real-world SAT instances","author":"Bayardo","year":"1997"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB003","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"304","article-title":"Performance test of local search algorithms using new types of random CNF formulas","author":"Cha","year":"1995"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB004","series-title":"Proc. AAAI-96, Portland, OR","first-page":"332","article-title":"Adding new clauses for faster local search","author":"Cha","year":"1996"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB005","series-title":"Proc. AAAI-96, Portland, OR","first-page":"338","article-title":"Weighting for Godot: Learning heuristics for GSAT","author":"Frank","year":"1996"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB006","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"384","article-title":"Learning short-term weights for GSAT","author":"Frank","year":"1997"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB007","series-title":"Proc. AAAI-93, Washington, DC","first-page":"28","article-title":"Towards an understanding of hill-climbing procedures for SAT","author":"Gent","year":"1993"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB008","series-title":"Hybrid Problems, Hybrid Solutions (AISB-95)","article-title":"Unsatisfied variables in local search","author":"Gent","year":"1995"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB009","series-title":"Proc. AAAI-98, Madison, WI","first-page":"431","article-title":"Boosting combinatorial search through randomization","author":"Gomes","year":"1998"},{"issue":"1","key":"10.1016\/S0004-3702(01)00151-5_BIB010","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1006314320276","article-title":"Heavy-tailed phenomena in satisfiability and constraint satisfaction problems","volume":"24","author":"Gomes","year":"2000","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(01)00151-5_BIB011","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"661","article-title":"On the run-time behavior of stochastic local search algorithms for SAT","author":"Hoos","year":"1999"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB012","series-title":"Proc. AAAI-96, Portland, OR","first-page":"1194","article-title":"Pushing the envelope: Planning, propositional logic, and stochastic search","author":"Kautz","year":"1996"},{"issue":"1","key":"10.1016\/S0004-3702(01)00151-5_BIB013","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/43.108614","article-title":"Test pattern generation using boolean satisfiability","volume":"11","author":"Larrabee","year":"1992","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB014","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"366","article-title":"Heuristics based on unit propagation for satisfiability problems","author":"Li","year":"1997"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB015","series-title":"Proc. AAAI-97, Providence, RI","first-page":"281","article-title":"Tabu search for SAT","author":"Mazure","year":"1997"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB016","series-title":"Proc. AAAI-97, Providence, RI","first-page":"321","article-title":"Evidence for invariants in local search","author":"McAllester","year":"1997"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB017","series-title":"Proc. AAAI-93, Washington, DC","first-page":"40","article-title":"The breakout method for escaping from local minima","author":"Morris","year":"1993"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB018","series-title":"Proc. AAAI-96, Portland, OR","first-page":"356","article-title":"Tuning local search for satisfiability testing","author":"Parkes","year":"1996"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB019","series-title":"Introduction to Probability Models","author":"Ross","year":"1997"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB020","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"297","article-title":"Local search characteristics of incomplete SAT procedures","author":"Schuurmans","year":"2000"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB021","series-title":"Proc. IJCAI-93, Chamb\u00e9ry, France","article-title":"Domain-independent extensions to GSAT: Solving large structured satisfiability problems","author":"Selman","year":"1993"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB022","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"337","article-title":"Noise strategies for improving local search","author":"Selman","year":"1994"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB023","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"50","article-title":"Ten challenges in propositional reasoning and search","author":"Selman","year":"1997"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB024","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"issue":"1","key":"10.1016\/S0004-3702(01)00151-5_BIB025","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008287028851","article-title":"A discrete Lagrangian based global search method for solving satisfiability problems","volume":"12","author":"Shang","year":"1998","journal-title":"J. Global Optimization"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB026","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"673","article-title":"Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems","author":"Wu","year":"1999"},{"key":"10.1016\/S0004-3702(01)00151-5_BIB027","series-title":"Proc. AAAI-2000, Austin, TX","first-page":"310","article-title":"An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems","author":"Wu","year":"2000"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T15:22:00Z","timestamp":1556205720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201001515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0004370201001515"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00151-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}