{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:50Z","timestamp":1725664970834},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540636144"},{"type":"electronic","value":"9783540696124"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63614-5_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:34:22Z","timestamp":1330281262000},"page":"600-608","source":"Crossref","is-referenced-by-count":0,"title":["Renaming a set of non-horn clauses"],"prefix":"10.1007","author":[{"given":"Xumin","family":"Nie","sequence":"first","affiliation":[]},{"given":"Qing","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,25]]},"reference":[{"key":"58_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00881948","volume":"13","author":"P. Baumgartner","year":"1994","unstructured":"P. Baumgartner and U. Furbach, Model elimination without contrapositives and its application to PTTP, Journal of Automated Reasoning 13 339\u2013359 (1994).","journal-title":"Journal of Automated Reasoning"},{"key":"58_CR2","unstructured":"W.F. Clocksin and C.S. Mellish, Programming in Prolog, Springer-Verlag (1981)."},{"key":"58_CR3","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H.Freeman and Company (1979)."},{"issue":"4","key":"58_CR4","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321850.321857","volume":"21","author":"L. Henschen","year":"1974","unstructured":"L. Henschen and L. Wos, Unit refutations and Horn sets, Journal of ACM 21 (4) (1974) 590\u2013605.","journal-title":"Journal of ACM"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of logic programming, Springer-Verlag (1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"58_CR6","series-title":"Information Processing","first-page":"569","volume-title":"Predicate logic as a programming language","author":"R.A. Kowalski","year":"1974","unstructured":"R.A. Kowalski, Predicate logic as a programming language, Information Processing, pp. 569\u2013574, North Holland, Stockholm (1974)."},{"issue":"1","key":"58_CR7","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/322047.322059","volume":"25","author":"H.R. Lewis","year":"1978","unstructured":"H.R. Lewis, Renaming a set of clauses as a Horn set, Journal of ACM 25 (1) (1978) 134\u2013135.","journal-title":"Journal of ACM"},{"issue":"3","key":"58_CR8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/321526.321527","volume":"16","author":"D.W. Loveland","year":"1969","unstructured":"D.W. Loveland, A simplified format for the model elimination theorem-proving procedure, Journal of ACM 16 (3) 349\u2013363 (1969).","journal-title":"Journal of ACM"},{"issue":"1","key":"58_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00249353","volume":"7","author":"D.W. Loveland","year":"1991","unstructured":"D.W. Loveland, Near-Horn Prolog and beyond, Journal of Automated Reasoning 7 (1) 1\u201326 (1991).","journal-title":"Journal of Automated Reasoning"},{"key":"58_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(85)90096-1","volume":"21","author":"H. Mannila","year":"1985","unstructured":"H. Mannila and K. Mehlhorn, A fast algorithm for renaming a set of clauses as a Horn set, Information Processing Letter 21 269\u2013272 (1985).","journal-title":"Information Processing Letter"},{"key":"58_CR11","unstructured":"D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, Proceeding of AAAI-92, pp. 459\u2013465 (1992)."},{"key":"58_CR12","unstructured":"X. Nie, Complexities of non-Horn clause logic programming, Methodologies for Intelligent Systems 5, Z. Ras, M. Zemankova, and M. Emrich, eds. 539\u2013544 (North-Holland, 1990)"},{"key":"58_CR13","doi-asserted-by":"crossref","unstructured":"X. Nie, How well are non-Horn clauses handled, 6th International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Computer Science 542, 580\u2013588 (Springer-Verlag, 1991).","DOI":"10.1007\/3-540-54563-8_121"},{"key":"58_CR14","unstructured":"X. Nie, A note on non-Horn clause logic programming, Artificial Intelligence, in press."},{"key":"58_CR15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(82)90041-8","volume":"18","author":"D.A. Plaisted","year":"1982","unstructured":"D.A. Plaisted, A simplified problem reduction format, Artificial Intelligence 18 227\u2013261 (1982).","journal-title":"Artificial Intelligence"},{"issue":"3","key":"58_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00244944","volume":"4","author":"D.A. Plaisted","year":"1988","unstructured":"D.A. Plaisted, Non-Horn clause logic programming without contrapositives, Journal of Automated Reasoning 4 (3) (1988) 287\u2013325.","journal-title":"Journal of Automated Reasoning"},{"key":"58_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0743-1066(92)90038-5","volume":"12","author":"D.W. Reed","year":"1992","unstructured":"D.W. Reed and D.W. Loveland, A comparison of three Prolog extensions, Journal of Logic Programming 12 25\u201350 (1992).","journal-title":"Journal of Logic Programming"},{"key":"58_CR18","doi-asserted-by":"crossref","unstructured":"D. W. Reed and D.W. Loveland, Near-Horn Prolog and the ancestry family of procedures, Annals of Mathematics and Artificial Intelligence 14 (1995).","DOI":"10.1007\/BF01530821"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63614-5_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:19:31Z","timestamp":1605629971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63614-5_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540636144","9783540696124"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-63614-5_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}