{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:24:32Z","timestamp":1648949072924},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5929,"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":[[1997,5]]},"DOI":"10.1016\/s0004-3702(97)00007-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"243-258","source":"Crossref","is-referenced-by-count":4,"title":["Non-Horn clause logic programming"],"prefix":"10.1016","volume":"92","author":[{"given":"Xumin","family":"Nie","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(97)00007-6_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":"Information Process. Lett."},{"key":"10.1016\/S0004-3702(97)00007-6_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00881948","article-title":"Model elimination without contrapositives and its application to PTTP","volume":"13","author":"Baumgartner","year":"1994","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB3","author":"Clocksin","year":"1981"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB4","series-title":"Proceedings Third ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB5","author":"Graham","year":"1989"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(97)00007-6_BIB7","series-title":"Information Processing","first-page":"569","article-title":"Predicate logic as a programming language","author":"Kowalski","year":"1974"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00244282","article-title":"SETHEO: a high-performance theorem prover","volume":"8","author":"Letz","year":"1992","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB9","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\/S0004-3702(97)00007-6_BIB10","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/321526.321527","article-title":"A simplified format for the model elimination theorem-proving procedure","volume":"16","author":"Loveland","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00249353","article-title":"Near-Horn Prolog and beyond","volume":"7","author":"Loveland","year":"1991","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB13","series-title":"Computational Logic: Essays in Honor of Alan Robinson","article-title":"A near-Horn Prolog for compilation","author":"Loveland","year":"1991"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB14","series-title":"Proceeding AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB15","first-page":"2","article-title":"Model elimination and its positive refinement","volume":"15","author":"Nie","year":"1990","journal-title":"Assoc. Autom. Reasoning Newslett."},{"key":"10.1016\/S0004-3702(97)00007-6_BIB16","article-title":"Renaming a set of non-Horn clauses","author":"Nie","year":"1996"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB17","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/12.53609","article-title":"Experimental results on subgoal reordering","volume":"39","author":"Nie","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0004-3702(97)00007-6_BIB18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(82)90041-8","article-title":"A simplified problem reduction format","volume":"18","author":"Plaisted","year":"1982","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(97)00007-6_BIB19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00244944","article-title":"Non-Horn clause logic programming without contrapositives","volume":"4","author":"Plaisted","year":"1988","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB20","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF00244355","article-title":"A sequent-style model elimination strategy and a positive refinement","volume":"6","author":"Plaisted","year":"1990","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB21","series-title":"Proceedings 12th Conference on Automated Deduction","first-page":"57","article-title":"The search efficiency of theorem proving strategies","author":"Plaisted","year":"1994"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0743-1066(92)90038-5","article-title":"A comparison of three Prolog extensions","volume":"12","author":"Reed","year":"1992","journal-title":"J. Logic Program."},{"key":"10.1016\/S0004-3702(97)00007-6_BIB23","doi-asserted-by":"crossref","DOI":"10.1007\/BF01530821","article-title":"Near-Horn Prolog and the ancestry family of procedures","volume":"14","author":"Reed","year":"1995","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/S0004-3702(97)00007-6_BIB24","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00297245","article-title":"A Prolog technology theorem prover: implementation by an extended Prolog compiler","volume":"4","author":"Stickel","year":"1988","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB25","article-title":"A Prolog technology theorem prover: a new exposition and implementation in Prolog","author":"Stickel","year":"1989"},{"key":"10.1016\/S0004-3702(97)00007-6_BIB26","series-title":"Proceedings IJCAI-85","first-page":"1073","article-title":"An analysis of consecutively bounded depth-first search with application in automated deduction","author":"Stickel","year":"1985"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000076?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000076?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:28:36Z","timestamp":1555064916000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370297000076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0004370297000076"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(97)00007-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}