{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:06Z","timestamp":1749124026725},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90098-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"109-111","source":"Crossref","is-referenced-by-count":13,"title":["Detecting embedded Horn structure in propositional logic"],"prefix":"10.1016","volume":"42","author":[{"given":"V.","family":"Chandru","sequence":"first","affiliation":[]},{"given":"J.N.","family":"Hooker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90098-G_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0196-6774(80)90007-3","article-title":"Recognizing disguised NR(1) instance of the satisfiability problem","volume":"1","author":"Aspvall","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(92)90098-G_BIB2","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding a maximum clique in an arbitrary graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90098-G_BIB3","series-title":"Tech. Rept.","article-title":"An exact algorithm for the maximum clique problem","author":"Carraghan","year":"1990"},{"key":"10.1016\/0020-0190(92)90098-G_BIB4","first-page":"33","article-title":"On renamable Horn and generalized Horn functions","volume":"1","author":"Chandru","year":"1990","journal-title":"Ann. Math. of and AI"},{"key":"10.1016\/0020-0190(92)90098-G_BIB5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"1","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0020-0190(92)90098-G_BIB6","series-title":"Tech. Rept.","article-title":"A greedy randomized adaptive search procedure for maximum independent set","author":"Feo","year":"1989"},{"key":"10.1016\/0020-0190(92)90098-G_BIB7","first-page":"167","article-title":"A computational study of the weighted independent set problem for general graphs","volume":"12","author":"Kopf","year":"1987","journal-title":"Found. Control Engrg."},{"key":"10.1016\/0020-0190(92)90098-G_BIB8","series-title":"Tech. Rept.","article-title":"A branch and bound algorithm for the maximum clique problem","author":"Pardalos","year":"1990"},{"key":"10.1016\/0020-0190(92)90098-G_BIB9","series-title":"Ph.D. Thesis","article-title":"Fast algorithms for vertex packing and related problems","author":"Xue","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290098G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290098G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:10Z","timestamp":1555144030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290098G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290098G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90098-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}