{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:55:59Z","timestamp":1649156159376},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540545675","type":"print"},{"value":"9783642467523","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/978-3-642-46752-3_2","type":"book-chapter","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T07:25:04Z","timestamp":1331191504000},"page":"16-29","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Clause Condensing"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"unpublished manuscript","author":"LD Baxter","year":"1977","unstructured":"L.D. Baxter. The NP-completeness of subsumption. unpublished manuscript, 1977."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"S. Ceri, G. Gottlob, and L. Tanca. What you always wanted to know about datalog (and never dared to ask). IEEE Transactions on Knowledge and Data Engineering, 1(1), March 1989.","DOI":"10.1109\/69.43410"},{"key":"2_CR3","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"CL Chang","year":"1973","unstructured":"C.L. Chang and R.C.T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973."},{"key":"2_CR4","volume-title":"Programming in Prolog","author":"WF Clocksin","year":"1981","unstructured":"W.F. Clocksin and C.S. Mellish. Programming in Prolog. Springer Berlin\/Heidelberg\/New York, 1981."},{"key":"2_CR5","volume-title":"Computers and Intractability \u2014 A Guide to NP-Completeness","author":"M Garey","year":"1979","unstructured":"M. Garey and D.S. Johnson. Computers and Intractability \u2014 A Guide to NP-Completeness. W.H.Freeman, New York, 1979."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(87)90103-7","volume":"24","author":"G Gottlob","year":"1987","unstructured":"G. Gottlob. Subsumption and implication. Information Processing Letters, 24:109\u2013111, January 1987.","journal-title":"Information Processing Letters"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"G. Gottlob and A. Leitsch. Fast subsumption algorithms. In Proceedings of the EUROCAL 85 Conference on Computer Algebra, Lecture Notes in Computer Science. Springer Verlag, 1985.","DOI":"10.1007\/3-540-15984-3_239"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/3149.214118","volume":"32","author":"G Gottlob","year":"1985","unstructured":"G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the ACM, 32(2):280\u2013295, April 1985.","journal-title":"Journal of the ACM"},{"key":"2_CR9","volume-title":"Logic and Databases","year":"1978","unstructured":"H. Gallaire and J. Minker, editors. Logic and Databases. Plenum Press, New York, 1978."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"W.H. Joyner. Automatic Theorem Proving and the Decision Problem. PhD thesis, Harvard University, May 1973.","DOI":"10.1109\/SWAT.1973.2"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/321958.321960","volume":"23","author":"WH Joyner","year":"1976","unstructured":"W.H. Joyner. Resolution strategies as decision procedures. Journal of the ACM, 23(1):398\u2013417, July 1976.","journal-title":"Journal of the ACM"},{"key":"2_CR12","volume-title":"Informatik+Oekonomie","author":"A Leitsch","year":"1988","unstructured":"A. Leitsch. Implication algorithms for classes of Horn clauses, in: Informatik+Oekonomie, Berlin, 1988."},{"key":"2_CR13","volume-title":"Computational Intelligence II","author":"A Leitsch","year":"1989","unstructured":"A. Leitsch and G. Gottlob. Deciding Horn clause implication problems by ordered semantic resolution. In F. Gardin, editor, Computational Intelligence II, Proceedings of the International Symposium, Milan, Italy, 25\u201327 Sept 1989. North Holland, Amsterdam, 1989."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1984","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, Berlin, 1984, 1987."},{"key":"2_CR15","volume-title":"Automated Theorem Proving: A Logical Basis","author":"D Loveland","year":"1978","unstructured":"D. Loveland. Automated Theorem Proving: A Logical Basis. North Holland, Amsterdam, 1978."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","volume":"37","author":"CH Papadimitriou","year":"1988","unstructured":"C.H. Papadimitriou and D. Wolfe. The complexity of facets resolved. J. Comput. System Sei., 37:2\u201313, 1988.","journal-title":"J. Comput. System Sci."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"CH Papadimitriou","year":"1984","unstructured":"C.H. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). J. Comput. System Sci., 28:244\u2013259, 1984.","journal-title":"J. Comput. System Sci."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(88)90146-6","volume":"59","author":"M Schmidt-Schauss","year":"1988","unstructured":"M. Schmidt-Schauss. Implication of clauses is undecidable. Theoretical Computer Science, 59:287\u2013296, 1988.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1145\/321784.321792","volume":"20","author":"RB Stillman","year":"1973","unstructured":"R.B. Stillman. The concept of weak substitution in theorem proving. Journal of the ACM, 20(4):648\u2013667, October 1973.","journal-title":"Journal of the ACM"}],"container-title":["7. \u00d6sterreichische Artificial-Intelligence-Tagung \/ Seventh Austrian Conference on Artificial Intelligence","Informatik-Fachberichte"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-46752-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:50:56Z","timestamp":1620136256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-46752-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545675","9783642467523"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-46752-3_2","relation":{},"ISSN":["0343-3005"],"issn-type":[{"value":"0343-3005","type":"print"}],"published":{"date-parts":[[1991]]}}}