{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:44Z","timestamp":1725663704901},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566021"},{"type":"electronic","value":"9783540475972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56602-3_127","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:20:01Z","timestamp":1330237201000},"page":"56-64","source":"Crossref","is-referenced-by-count":2,"title":["Generalization under implication by using or-introduction"],"prefix":"10.1007","author":[{"given":"Peter","family":"Idestam-Almquist","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"M. Bain and S. Muggleton. Non-monotonic learning. Machine Intelligence, 12, 1991.","DOI":"10.1016\/B978-1-55860-200-7.50078-7"},{"key":"4_CR2","unstructured":"Jean H. Gallier. Logic for Computer Science: Foundations of Automatic Theorem Proving. John Wiley & Sons, 1987."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"P. Idestam-Almquist. Generalization under implication by recursive antiunification. Submitted to the International Workshop on Inductive Logic Programming 1993.","DOI":"10.1016\/B978-1-55860-307-3.50026-5"},{"key":"4_CR4","unstructured":"P. Idestam-Almquist. Generalization under implication. Technical report, Department of Computer and Systems Sciences, Stockholm University, 1992. Report 92-020-SYSLAB."},{"key":"4_CR5","volume-title":"Proceedings of the International Conference on Fifth Generation Computer Systems 1992","author":"P. Idestam-Almquist","year":"1992","unstructured":"P. Idestam-Almquist. Learning missing clauses by inverse resolution. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, Ohmsha, Tokyo, 1992."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Lapointe and Stan Matwin. Sub-unification: A tool for efficient induction of recursive programs. In Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, 1992.","DOI":"10.1016\/B978-1-55860-247-2.50040-1"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. Second edition.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"4","key":"4_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF03037089","volume":"8","author":"S. Muggleton","year":"1991","unstructured":"Stephen Muggleton. Inductive logic programming. New Generation Computing, 8(4):295\u2013318, 1991.","journal-title":"New Generation Computing"},{"key":"4_CR9","unstructured":"Stephen Muggleton. Inverting implication. In Stephen Muggleton, editor, Proceedings of the International Workshop on Inductive Logic Programming, 1992."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Stephen Muggleton and Wray Buntine. Machine invention of first-order predicates by inverting resolution. In Proceedings of the Fifth International Conference on Machine Learning. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-64-4.50040-2"},{"key":"4_CR11","volume-title":"Efficient induction of logic programs","author":"S. Muggleton","year":"1990","unstructured":"Stephen Muggleton and C. Feng. Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, Tokyo, 1990. Ohmsha Publishers."},{"key":"4_CR12","unstructured":"Tim Niblett. A study of generalization in logic programs. In Proceedings of the Third European Working Session on Learning. Pitman, 1988."},{"key":"4_CR13","unstructured":"Nilsson and Genesereth. Logic Foundations of Artificial Intelligence. Morgan Kaufmann, 1987."},{"key":"4_CR14","unstructured":"G. D. Plotkin. Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, 1971."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"J. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1), 1965.","DOI":"10.1145\/321250.321253"},{"key":"4_CR16","volume-title":"Inductive Logic Programming","author":"C. Rouveirol","year":"1992","unstructured":"C\u00e9line Rouveirol. Extensions of inversion of resolution applied to theory completion. In Stephen Muggleton, editor, Inductive Logic Programming. Academic Press, San Diego, CA, 1992."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"C\u00e9line Rouveriol and Jean Fran\u00e7ois Puget. Beyond inversion of resolution. In Proceedings of the Seventh International Conference on Machine Learning. Morgan Kaufmann, 1990.","DOI":"10.1016\/B978-1-55860-141-3.50018-3"},{"key":"4_CR18","unstructured":"Richmond H. Thomason. Symbolic Logic\u2014An Introduction. McMillan Publishers, 1970."},{"key":"4_CR19","unstructured":"Ruediger Wirth. Completing logic programs by inverse resolution. In Proceedings of the Fourth Working Session on Learning. Pitman, 1989."}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56602-3_127.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:44Z","timestamp":1605629084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56602-3_127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566021","9783540475972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-56602-3_127","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}