{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T01:45:36Z","timestamp":1714873536570},"reference-count":21,"publisher":"Elsevier","isbn-type":[{"value":"9781558602472","type":"print"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1016\/b978-1-55860-247-2.50025-5","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T02:53:05Z","timestamp":1404183185000},"page":"154-162","source":"Crossref","is-referenced-by-count":9,"title":["Towards Inductive Generalisation in Higher Order Logic"],"prefix":"10.1016","author":[{"given":"Cao","family":"Feng","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/B978-1-55860-247-2.50025-5_bib1","doi-asserted-by":"crossref","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib2","series-title":"Combinatory Logic (Volume I)","author":"Curry","year":"1958"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib3","doi-asserted-by":"crossref","unstructured":"S. Dietzen and F. Pfenning. Higher-order and modal logic as a framework for explanation-based generalization. In B. Spatz, editor, Proceedings of the sixth international workshop on machine learning. Cornell University, Ithaca, New York, pages 447\u2013449. San Mateo, CA: Morgan Kaufmann, June 1989.","DOI":"10.1016\/B978-1-55860-036-2.50113-2"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib4","series-title":"Least general generalisation in higher order logic","author":"Feng","year":"1991"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib5","unstructured":"Masateru Harao. Analogical reasoning based on higher order unification. In First International Conference on Algorithmic Learning Theory, pages 151\u2013163, Tokyo, Japan, 1990. Japanese Society for Artificial Intellligence."},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00264598","article-title":"Proving and applying program transformations expressed with second order patterns","volume":"11","author":"Huet","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib8","unstructured":"J. Kietz and S. Wrobel. Controlling the complexity of learning in logic through syntact ic and task orieted models. In S. Muggleton, editor, Proceedings of the First International Workshop on Inductive Logic Programming, Viana de Castelo, Portugal, to appear. Academic Press."},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib9","series-title":"EWSL '91: machine learning: proceedings of the European working session on learning","first-page":"265","article-title":"Learning nonrecursive definitions of relations with linus","author":"Lavrac","year":"1991"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib10","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine (part 1)","volume":"3","author":"McCarthy","year":"1960","journal-title":"Communications of the Association of Computational Machinery"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib11","series-title":"Extensions of logic programming","first-page":"237","article-title":"A logic programming language with \u03bb-abstraction, function variables and simple unification","author":"Miller","year":"1990"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib12","unstructured":"S. Muggleton and C. Feng. Efficient induction of logic programs. In First International Conference on Algorithmic Learning Theory, pages 369\u2013381, Tokyo, Japan, 1990. Japanese Society for Artificial Intellligence."},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib13","doi-asserted-by":"crossref","unstructured":"S. Muggleton. Inductive logic programming. In First International Conference on Algorithmic Learning Theory, volume Also in New Generation Computing, 1991, Vol 8, pages 42\u201361, Tokyo, Japan, 1990. Japanese Society for Artificial Intellligence.","DOI":"10.1007\/BF03037089"},{"issue":"4","key":"10.1016\/B978-1-55860-247-2.50025-5_bib14","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/96559.96570","article-title":"Higher-order horn clauses","volume":"37","author":"Nadathur","year":"1990","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"10.1016\/B978-1-55860-247-2.50025-5_bib15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(86)90015-4","article-title":"Natural deduction as higher-order resolution","volume":"3","author":"Paulson","year":"1986","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib16","doi-asserted-by":"crossref","unstructured":"F. Pfenning. Unification and anti-unification in the Calculus of Constructions. In G. Kahn, editor, Sixth Annual Symposium on Logic in Computer Science, pages 74\u201385. IEEE, July 1991.","DOI":"10.1109\/LICS.1991.151632"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib17","first-page":"153","article-title":"A note on inductive generalisation","volume":"5","author":"Plotkin","year":"1970"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib18","first-page":"101","article-title":"A further note on inductive generalisation","volume":"6","author":"Plotkin","year":"1971"},{"issue":"3","key":"10.1016\/B978-1-55860-247-2.50025-5_bib19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00117105","article-title":"Learning logical definitions from relations","volume":"5","author":"Quinlan","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib20","series-title":"EWSL'89: proceedings of the fourth european working session on learning, Montpellier, France","article-title":"Constructive induction by analogy: a new method to learn how to learn?","author":"De Raedt","year":"1990"},{"key":"10.1016\/B978-1-55860-247-2.50025-5_bib21","first-page":"135","article-title":"Transformational systems and the algebraic structure of atomic formulas","volume":"5","author":"Reynolds","year":"1970"}],"container-title":["Machine Learning Proceedings 1992"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558602472500255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558602472500255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T05:43:11Z","timestamp":1565588591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558602472500255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9781558602472"],"references-count":21,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-247-2.50025-5","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}