{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:58:38Z","timestamp":1773385118016,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6355,"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":[[1996,3]]},"DOI":"10.1016\/0004-3702(95)00049-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:38Z","timestamp":1027640258000},"page":"111-125","source":"Crossref","is-referenced-by-count":22,"title":["Some pitfalls for experimenters with random SAT"],"prefix":"10.1016","volume":"81","author":[{"given":"David G.","family":"Mitchell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector J.","family":"Levesque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0004-3702(95)00049-6_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0004-3702(95)00049-6_BIB2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0255(90)90030-E","article-title":"Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem","volume":"51","author":"Chao","year":"1990","journal-title":"Inform. Sci."},{"key":"10.1016\/0004-3702(95)00049-6_BIB3","series-title":"Proceedings IJCAI-91","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/0004-3702(95)00049-6_BIB4","series-title":"Proceedings AAAI-93","first-page":"21","article-title":"Experimental results on the cross-over point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(95)00049-6_BIB5","series-title":"Proceedings AAAI-94","article-title":"Experimental results on the application of satisfiability algorithms to scheduling problems","author":"Crawford","year":"1994"},{"issue":"5","key":"10.1016\/0004-3702(95)00049-6_BIB6","doi-asserted-by":"crossref","DOI":"10.1109\/34.211473","article-title":"Solving satisfiability via Boltzmann Machines","volume":"15","author":"d'Anjou","year":"1993","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00049-6_BIB7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(95)00049-6_BIB8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00049-6_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(86)90051-7","article-title":"On the probabilistic performance of algorithms for the satisfiability problem","volume":"23","author":"Franco","year":"1986","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0004-3702(95)00049-6_BIB10","series-title":"Analysis of three simple heuristics on a random instance of K-SAT","author":"Frieze","year":"1992"},{"key":"10.1016\/0004-3702(95)00049-6_BIB11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(89)90009-5","article-title":"Algorithms for testing the satisfiability of propositional formulae","volume":"7","author":"Gallo","year":"1989","journal-title":"J. Logic Program."},{"key":"10.1016\/0004-3702(95)00049-6_BIB12","author":"Garey","year":"1979"},{"key":"10.1016\/0004-3702(95)00049-6_BIB13","series-title":"Proceedings KI-94","article-title":"The hardest random SAT problems","author":"Gent","year":"1994"},{"key":"10.1016\/0004-3702(95)00049-6_BIB14","series-title":"Proceedings ECAI-94","article-title":"The SAT phase transition","author":"Gent","year":"1994"},{"key":"10.1016\/0004-3702(95)00049-6_BIB15","article-title":"On the complexity of the satisfiability problem","author":"Goldberg","year":"1979"},{"issue":"1","key":"10.1016\/0004-3702(95)00049-6_BIB16","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/130836.130837","article-title":"Efficient local search for very large-scale satisfiability problems","volume":"3","author":"Gu","year":"1992","journal-title":"SIGART Bull."},{"issue":"1","key":"10.1016\/0004-3702(95)00049-6_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(88)90044-2","article-title":"Resolution vs. cutting plane solution of inference problems: some computational experience","volume":"7","author":"Hooker","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0004-3702(95)00049-6_BIB18","series-title":"Integer Programming and Combinatorial Optimization","first-page":"333","article-title":"Computational experience with an interior point algorithm on the satisfiability problem","author":"Kamath","year":"1990"},{"key":"10.1016\/0004-3702(95)00049-6_BIB19","series-title":"Proceedings FOCS-94","article-title":"Tail bounds for occupancy and the satisfiability threshold conjecture","author":"Kamath","year":"1994"},{"key":"10.1016\/0004-3702(95)00049-6_BIB20","series-title":"Proceedings KR-94","first-page":"374","article-title":"Easy to be hard: difficult problems for greedy algorithms","author":"Konolige","year":"1994"},{"key":"10.1016\/0004-3702(95)00049-6_BIB21","article-title":"Evidence for a satisfiability threshold for random 3CNF formulas","author":"Larrabee","year":"1992"},{"issue":"4","key":"10.1016\/0004-3702(95)00049-6_BIB22","article-title":"A survey of average time analyses of satisfiability algorithms","volume":"13","author":"Purdom","year":"1990","journal-title":"J. Inf. Process."},{"key":"10.1016\/0004-3702(95)00049-6_BIB23","series-title":"Proceedings AAAI-94","first-page":"337","article-title":"Noise strategies for improving local search","author":"Selman","year":"1994"},{"key":"10.1016\/0004-3702(95)00049-6_BIB24","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(95)00056-9","article-title":"Critical behavior in the computational cost of satisfiability testing","volume":"81","author":"Selman","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00049-6_BIB25","series-title":"Proceedings AAAI-92","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/0004-3702(95)00049-6_BIB26","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","article-title":"Generating hard satisfiability problems","volume":"81","author":"Selman","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00049-6_BIB27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0020-0190(92)90177-W","article-title":"Solving the satisfiability problem by using randomized approach","volume":"41","author":"Wu","year":"1992","journal-title":"Inf. Process. Lett."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T21:56:58Z","timestamp":1555538218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000496"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00049-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}