{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:40:44Z","timestamp":1648888844577},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5678,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0743-1066(97)00063-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"59-66","source":"Crossref","is-referenced-by-count":0,"title":["The horn basis of a set of clauses"],"prefix":"10.1016","volume":"34","author":[{"given":"Jean-Jacques","family":"H\u00e9brard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Luquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(97)00063-0_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\/S0743-1066(97)00063-0_BIB2","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\/S0743-1066(97)00063-0_BIB3","first-page":"21","article-title":"Polynomial-Time Inference of All Valid Implications for Horn and Related Formul\u00e6","volume":"1","author":"Boros","year":"1990","journal-title":"Ann. Math. AI"},{"key":"10.1016\/S0743-1066(97)00063-0_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(94)90033-7","article-title":"Recognition of q-Horn Formul\u00e6 in Linear Time","volume":"55","author":"Boros","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0743-1066(97)00063-0_BIB5","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\/S0743-1066(97)00063-0_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(92)90098-G","article-title":"Detecting Embedded Horn Structure in Propositional Logic","volume":"42","author":"Chandru","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0743-1066(97)00063-0_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(92)90081-6","article-title":"A Hierarchy of Tractable Satisfiability Problems","volume":"44","author":"Dalal","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0743-1066(97)00063-0_BIB8","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 Formul\u00e6","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00063-0_BIB9","author":"Garey","year":"1979"},{"key":"10.1016\/S0743-1066(97)00063-0_BIB10","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\/S0743-1066(97)00063-0_BIB11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(94)90015-9","article-title":"A Linear Algorithm for Renaming a Set of Clauses as a Horn Set","volume":"124","author":"H\u00e9brard","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0743-1066(97)00063-0_BIB12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(90)90069-A","article-title":"Existence of Simple Propositional Formulas","volume":"36","author":"Kleine B\u00fcning","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0743-1066(97)00063-0_BIB13","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\/S0743-1066(97)00063-0_BIB14","doi-asserted-by":"crossref","first-page":"341","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."},{"key":"10.1016\/S0743-1066(97)00063-0_BIB15","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-First Search and Linear Graph Algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000630?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000630?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T05:26:16Z","timestamp":1555392376000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106697000630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0743106697000630"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(97)00063-0","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}