{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:46:10Z","timestamp":1752230770002},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201441"},{"type":"electronic","value":"9783540399179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39917-9_12","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:02:15Z","timestamp":1277683335000},"page":"164-179","source":"Crossref","is-referenced-by-count":4,"title":["On Condensation of a Clause"],"prefix":"10.1007","author":[{"given":"Kouichi","family":"Hirata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-63577-7_59","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"1997","unstructured":"Arimura, H.: Learning acyclic first-order Horn sentences from entailment. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol.\u00a01316, pp. 432\u2013445. Springer, Heidelberg (1997)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R. Boppana","year":"1992","unstructured":"Boppana, R., Halld\u00f3rsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT\u00a032, 180\u2013196 (1992)","journal-title":"BIT"},{"key":"12_CR3","unstructured":"Baxter, L.D.: The complexity of unification, Doctoral Thesis, Department of Computer Science, University of Waterloo (1977)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.: An exact algorithm for the maximum clique problem. Operations Research Letters\u00a09, 375\u2013382 (1990)","journal-title":"Operations Research Letters"},{"key":"12_CR5","volume-title":"Symbolic logic and mechanical theorem proving","author":"C.-L. Chang","year":"1973","unstructured":"Chang, C.-L., Lee, R.C.-T.: Symbolic logic and mechanical theorem proving. Academic Press, London (1973)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"C. Chekuri","year":"2000","unstructured":"Chekuri, C., Rajaraman, A.: Conjunctive query containment revised. Theoretical Computer Science\u00a0239, 211\u2013229 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(93)90069-N","volume":"61","author":"G. Gottlob","year":"1993","unstructured":"Gottlob, G., Ferm\u00fcller, C.G.: Removing redundancy from a clause. Artificial Intelligence\u00a061, 263\u2013289 (1993)","journal-title":"Artificial Intelligence"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Sloan, R.H., Tur\u00e1n, G.: Learning logic programs by using the product homomorphism method. In: Proc. 10th Annual Workshop on Computational Learning Theory, pp. 10\u201320 (1997)","DOI":"10.1145\/267460.267468"},{"key":"12_CR10","first-page":"172","volume-title":"Advances in inductive logic programming","author":"T. Horv\u00e1th","year":"1996","unstructured":"Horv\u00e1th, T., Tur\u00e1n, G.: Learning logic programs with structured background knowledge. In: de Raedt, L. (ed.) Advances in inductive logic programming, pp. 172\u2013191. IOS Press, Amsterdam (1996)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/321958.321960","volume":"23","author":"W.H. Joyner","year":"1976","unstructured":"Joyner, W.H.: Resolution strategies as decision procedures. Journal of the ACM\u00a023, 398\u2013417 (1976)","journal-title":"Journal of the ACM"},{"key":"12_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60605-2","volume-title":"The resolution calculus","author":"A. Leitsch","year":"1997","unstructured":"Leitsch, A.: The resolution calculus. Springer, Heidelberg (1997)"},{"key":"12_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of logic programming (2nd extended edition). Springer, Heidelberg (1987)"},{"key":"12_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44797-0_14","volume-title":"Inductive Logic Programming","author":"J. Maloberti","year":"2001","unstructured":"Maloberti, J., Sebag, M.: \u03b8-subsumption in a constraint satisfaction perspective. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 164\u2013178. Springer, Heidelberg (2001)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R. (eds.) Foundations of Inductive Logic Programming. LNCS (LNAI) , vol.\u00a01228. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-62927-0"},{"key":"12_CR16","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Machine Intelligence\u00a05, 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Reddy, C., Tadepalli, P.: Learning first-order acyclic Horn programs from entailment. In: Proc. 15th International Conference on Machine Learning, pp. 472\u2013480 (1998)","DOI":"10.1007\/BFb0027308"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF03037583","volume":"17","author":"C. Reddy","year":"1999","unstructured":"Reddy, C., Tadepalli, P.: Learning Horn definitions: Theory and application to planning. New Generation Computing\u00a017, 77\u201398 (1999)","journal-title":"New Generation Computing"},{"key":"12_CR19","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-63494-0_57","volume-title":"Inductive Logic Programming","author":"T. Scheffer","year":"1997","unstructured":"Scheffer, T., Herbrich, R., Wysotzki, F.: Efficient \u03b8-subsumption based on graph algorithms. In: ILP 1996. LNCS (LNAI), vol.\u00a01314, pp. 212\u2013228. Springer, Heidelberg (1997)"},{"key":"12_CR20","unstructured":"van der Laag, P.R.J.: An analysis of refinement operators in inductive logic programming, Ph.D. Thesis, Tinbergen Institute (1995)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39917-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:16:32Z","timestamp":1552608992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39917-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201441","9783540399179"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39917-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}