{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:37:45Z","timestamp":1761590265510,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4580,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["GR\/L\/77089"],"award-info":[{"award-number":["GR\/L\/77089"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s1567-8326(00)00002-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:28:14Z","timestamp":1027582094000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses"],"prefix":"10.1016","volume":"47","author":[{"given":"P.E.","family":"Dunne","sequence":"first","affiliation":[]},{"given":"T.J.M.","family":"Bench-Capon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB2","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-satisfiable problem","volume":"51","author":"Chao","year":"1990","journal-title":"Information Science"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB3","unstructured":"P. Cheeseman, B. Kanefsky, W. Taylor, Where the really hard problems are. in: Proceedings of the 12th IJCAI, 1991, pp. 331\u2013337"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB4","doi-asserted-by":"crossref","unstructured":"V. Chv\u00e1tal, B. Reed, Mick gets some (the odds are on his side), in: Proceedings of the 33rd IEEE FOCS, 1992, pp. 620\u2013627","DOI":"10.1109\/SFCS.1992.267789"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB5","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":"Journal of the ACM"},{"issue":"1\u20132","key":"10.1016\/S1567-8326(00)00002-3_NEWBIB6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","article-title":"Experimental results on the crossover point in random 3-SAT","volume":"81","author":"Crawford","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB7","unstructured":"P.E. Dunne, A.M. Gibbons, M. Zito, Algorithmic and complexity issues concerning phase-transitional issues in combinatorial problems, in: R. Raman, J. Simpson (Eds.), Proceedings of the 10th Australasian Workshop on Combinatorial Algorithms (AWOCA'99), University of Curtin, Perth, WA, August 1999, pp. 76\u201390 (available at: http\/\/:www.csc.liv.ac\/\u223cped\/papers\/awoca99.ps)"},{"year":"1974","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","key":"10.1016\/S1567-8326(00)00002-3_NEWBIB8"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB9","doi-asserted-by":"crossref","first-page":"2993","DOI":"10.1090\/S0002-9939-96-03732-X","article-title":"Every monotone graph property has a sharp threshold","volume":"124","author":"Friedgut","year":"1996","journal-title":"Proceedings of the American Mathematical Society"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB10","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1006\/jagm.1996.0016","article-title":"Analysis of two simple heuristics on a random instance of k-SAT","volume":"20","author":"Frieze","year":"1995","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB11","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1006\/jcss.1996.0081","article-title":"A threshold for unsatisfiability","volume":"53","author":"Goerdt","year":"1996","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB12","unstructured":"G. Istrate, M. Ogihara, The phase transition in random Horn satisfiability, Technical Report, Computer Science Department, University of Rochester, No. TR669, December 1997"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB13","doi-asserted-by":"crossref","unstructured":"L.M. Kirousis, E. Kranakis, D. Krizanc, A better upper bound for the unsatisfiability threshold, in: Proceedings of the DIMACS Workshop Satisfiability Problem: Theory and Applications, March 1996","DOI":"10.1090\/dimacs\/035\/18"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB14","doi-asserted-by":"crossref","unstructured":"L.M. Kirousis, E. Kranakis, D. Krizanc, Approximating the unsatisfiability threshold of random formulas, in: Proceedings of the Fourth Annual European Symposium on Algorithms, ESA'96, September 1996","DOI":"10.1007\/3-540-61680-2_44"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB15","unstructured":"T. Larrabee, Y. Tsuji, Evidence of satisfiability threshold for random 3CNF formulas, Technical Report UCSC-CRL-92-42, University of California, Santa Cruz, 1992"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB16","unstructured":"D.G. Mitchell, B. Selman, H.J. Levesque, Hard and easy distributions of SAT problems, in: Proc. AAAI-92, AAAI Press, MIT Press, Cambridge, MA, 1992, pp. 459\u2013465"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB17","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":"Artifical Intelligence"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0004-3702(95)00053-4","article-title":"Implicates and prime implicates in random 3-SAT","volume":"81","author":"Schrag","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1567-8326(00)00002-3_NEWBIB19","unstructured":"M. Zito, Ph.D. Dissertation, Department of Computer Science, University of Warwick, 1999"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832600000023?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832600000023?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:33:32Z","timestamp":1761590012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832600000023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S1567832600000023"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(00)00002-3","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2001,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(00)00002-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}