{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:00:50Z","timestamp":1757610050353,"version":"3.44.0"},"reference-count":20,"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":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,12]],"date-time":"1999-02-12T00:00:00Z","timestamp":918777600000},"content-version":"vor","delay-in-days":1078,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0004-3702(95)00051-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:04:40Z","timestamp":1027598680000},"page":"183-198","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["Hard random 3-SAT problems and the Davis-Putnam procedure"],"prefix":"10.1016","volume":"81","author":[{"given":"Jon W.","family":"Freeman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00051-8_BIB1","first-page":"143","article-title":"Report on a SAT competition","volume":"49","author":"Buro","year":"1993","journal-title":"EATCS Bull."},{"key":"10.1016\/0004-3702(95)00051-8_BIB2","series-title":"Proceedings Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"322","article-title":"On the satisfiability and maximum satisfiability of random 3-CNF formulas","author":"Broder","year":"1993"},{"issue":"4","key":"10.1016\/0004-3702(95)00051-8_BIB3","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","article-title":"Many hard examples for resolution","volume":"35","author":"Chv\u00e1tal","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00051-8_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"},{"year":"1993","series-title":"Satisfiability Suggested Format","author":"Dimacs Challenge Committee","key":"10.1016\/0004-3702(95)00051-8_BIB5"},{"key":"10.1016\/0004-3702(95)00051-8_BIB6","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)00051-8_BIB7","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)00051-8_BIB8","series-title":"Proceedings KR-94","article-title":"Directional resolution: the Davis-Putnam procedure, revisited","author":"Dechter","year":"1994"},{"key":"10.1016\/0004-3702(95)00051-8_BIB9","unstructured":"O. Dubois, P. Andre, Y. Boufkhad and J. Carlier, SAT versus UNSAT, in: Proceedings DIMACS Challenge II Workshop (submitted)."},{"key":"10.1016\/0004-3702(95)00051-8_BIB10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Discrete Appl. Math."},{"article-title":"Improvements to propositional satisfiability search algorithms","year":"1995","author":"Freeman","key":"10.1016\/0004-3702(95)00051-8_BIB11"},{"key":"10.1016\/0004-3702(95)00051-8_BIB12","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58715-2_143","article-title":"Branching rules for satisfiability","author":"Hooker","year":"1994"},{"key":"10.1016\/0004-3702(95)00051-8_BIB13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01531077","article-title":"Solving propositional satisfiability problems","volume":"1","author":"Jeroslow","year":"1990","journal-title":"Ann. Math. Artif. Intell."},{"year":"1994","series-title":"Why Mick doesn't get any: thresholds for (un)satisfiability","author":"Kamath","key":"10.1016\/0004-3702(95)00051-8_BIB14"},{"key":"10.1016\/0004-3702(95)00051-8_BIB15","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behavior in the satisfiability of random Boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00051-8_BIB16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(92)90029-U","article-title":"On the greedy algorithm for satisfiability","volume":"43","author":"Koutsoupias","year":"1992","journal-title":"Inf. Process. Lett."},{"article-title":"Evidence for a satisfiability threshold for random 3CNF formulas","year":"1992","author":"Larrabee","key":"10.1016\/0004-3702(95)00051-8_BIB17"},{"key":"10.1016\/0004-3702(95)00051-8_BIB18","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"article-title":"Satisfiability and hypergraphs","year":"1993","author":"Pretolani","key":"10.1016\/0004-3702(95)00051-8_BIB19"},{"key":"10.1016\/0004-3702(95)00051-8_BIB20","series-title":"Presented at the DIMACS Challenge II Workshop","article-title":"Incomplete thoughts about incomplete satisfiability problems","author":"van Gelder","year":"1993"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000518?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000518?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T13:01:08Z","timestamp":1756904468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000518"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00051-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[1996,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hard random 3-SAT problems and the Davis-Putnam procedure","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0004-3702(95)00051-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}