{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:46:58Z","timestamp":1749124018338},"reference-count":16,"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)00047-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:20:41Z","timestamp":1027596041000},"page":"59-80","source":"Crossref","is-referenced-by-count":17,"title":["The satisfiability constraint gap"],"prefix":"10.1016","volume":"81","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00047-X_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":"Inform. Process. Lett."},{"key":"10.1016\/0004-3702(95)00047-X_BIB2","unstructured":"A.B. Baker, Personal communication (1995)."},{"key":"10.1016\/0004-3702(95)00047-X_BIB3","series-title":"Proceedings IJCAI-9I","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/0004-3702(95)00047-X_BIB4","series-title":"Proceedings AAAI-93","first-page":"21","article-title":"Experimental results on the crossover point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(95)00047-X_BIB5","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)00047-X_BIB6","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)00047-X_BIB7","series-title":"Presented at the Second DIMACS Challenge Workshop","article-title":"SAT versus UNSAT","author":"Dubois","year":"1993"},{"key":"10.1016\/0004-3702(95)00047-X_BIB8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","article-title":"Easy problems are sometimes hard","volume":"70","author":"Gent","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00047-X_BIB9","series-title":"Proceedings ECAI-94","first-page":"105","article-title":"The SAT phase transition","author":"Gent","year":"1994"},{"key":"10.1016\/0004-3702(95)00047-X_BIB10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","article-title":"The hardest constraint problems: A double phase transition","volume":"69","author":"Hogg","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00047-X_BIB11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01531074","article-title":"Branch-and-cut solution of inference problems in prepositional logic","volume":"1","author":"Hooker","year":"1990","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/0004-3702(95)00047-X_BIB12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","article-title":"Phase transitions in artificial intelligence systems","volume":"33","author":"Huberman","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00047-X_BIB13","first-page":"439","article-title":"The statistical mechanics of k-satisfaction","volume":"6","author":"Kirkpatrick","year":"1994"},{"key":"10.1016\/0004-3702(95)00047-X_BIB14","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0004-3702(95)00047-X_BIB15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","article-title":"Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis","volume":"9","author":"Stallman","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00047-X_BIB16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","volume":"70","author":"Williams","year":"1994","journal-title":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029500047X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029500047X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:58:32Z","timestamp":1556755112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029500047X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["000437029500047X"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00047-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}