{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:31Z","timestamp":1759638751726},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540661092"},{"type":"electronic","value":"9783540487517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48751-4_20","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T01:42:59Z","timestamp":1183426979000},"page":"210-221","source":"Crossref","is-referenced-by-count":8,"title":["A Bounded Search Space of Clausal Theories"],"prefix":"10.1007","author":[{"given":"Herman","family":"Midelfart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"H. Arimura. Learning acyclic first-order horn sentences from entailment. In Proc. of ALT-97, LNAI 1316, pp. 432\u2013445. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63577-7_59"},{"key":"20_CR2","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability-A Guide to Theory of NP-completeness. Freeman, 1997."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"M. Krishna Rao and A. Satter. Learning from entailment of logic programs with local variables. Proc. of ALT-98, LNAI 1501, pp. 143\u2013157. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-49730-7_11"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"P. R. J. van der Laag and S.-H. Nienhuys-Cheng. Existence and nonexistence of complete refinement operators. In Proc. of ECML-94, LNAI 784, pp. 307\u2013322. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57868-4_66"},{"issue":"3\/4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"S. Muggleton. Inverse entailment and Progol. New Generation Computing, 13(3\/4):245\u2013286, 1995.","journal-title":"New Generation Computing"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"S. Muggleton. Completing inverse entailment. In Proc. of ILP-98, LNAI 1446, pp. 245\u2013249. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0027328"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming. LNAI 1228. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62927-0"},{"key":"20_CR8","unstructured":"G. D. Plotkin. Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, 1971."},{"key":"20_CR9","first-page":"135","volume":"5","author":"J. C. Reynolds","year":"1970","unstructured":"J. C. Reynolds. Transformational systems and the algebraic structure of atomic formulas. In Machine Intelligence, vol. 5, pp. 135\u2013151. Edinburgh University Press, 1970.","journal-title":"Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48751-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T01:55:01Z","timestamp":1556589301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48751-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540661092","9783540487517"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48751-4_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}