{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:21:17Z","timestamp":1648560077396},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0304-3975(94)90015-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"343-350","source":"Crossref","is-referenced-by-count":9,"title":["A linear algorithm for renaming a set of clauses as a Horn set"],"prefix":"10.1016","volume":"124","author":[{"given":"Jean-Jacques","family":"H\u00e9brard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90015-9_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0196-6774(80)90007-3","article-title":"Recognizing disguised NR(1) instances of the satisfiability problem","volume":"1","author":"Aspvall","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)90015-9_BIB2","first-page":"33","article-title":"On renamable Horn and generalized Horn functions","volume":"1","author":"Chandru","year":"1990","journal-title":"Ann. Math. AI"},{"key":"10.1016\/0304-3975(94)90015-9_BIB3","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":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90015-9_BIB4","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90015-9_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0743-1066(91)90015-H","article-title":"A linear control algorithm for a class of rule-based systems","volume":"11","author":"Ghallab","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)90015-9_BIB6","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/322047.322059","article-title":"Renaming a set of clauses as a Horn set","volume":"25","author":"Lewis","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90015-9_BIB7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(89)90229-9","article-title":"On renaming a set of clauses as a Horn set","volume":"30","author":"Lindhorst","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90015-9_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(85)90096-1","article-title":"A fast algorithm for renaming a set of clauses as a Horn set","volume":"21","author":"Mannila","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90015-9_BIB9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1093\/comjnl\/8.4.341","article-title":"Theorem-proving for computers: some results on resolution and renaming","volume":"8","author":"Meltzer","year":"1966","journal-title":"Comput. J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:21Z","timestamp":1555129581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0304397594900159"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90015-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}