{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:21:22Z","timestamp":1725585682347},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212949"},{"type":"electronic","value":"9783642212956"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21295-6_23","type":"book-chapter","created":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T18:36:51Z","timestamp":1307903811000},"page":"198-205","source":"Crossref","is-referenced-by-count":0,"title":["Can HOLL Outperform FOLL?"],"prefix":"10.1007","author":[{"given":"Niels","family":"Pahlavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"The \u03bbcalculus its syntax and semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The \u03bbcalculus its syntax and semantics. North-Holland, Amsterdam (1984)"},{"key":"23_CR2","unstructured":"Dynasty, R.: http:\/\/en.wikipedia.org\/wiki\/Tsars_of_Russia_family_tree"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Farmer, W.: The seven virtues of simple type theory. J. Applied Logic (2008)","DOI":"10.1016\/j.jal.2007.11.001"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Feng, C., Muggleton, S.H.: Towards inductive generalisation in higher order logic. In: Proc. Ninth Int. Work. on Machine Learning, pp. 154\u2013162 (1992)","DOI":"10.1016\/B978-1-55860-247-2.50025-5"},{"key":"23_CR5","unstructured":"Furukawa, K., Imai, M., Goebel, R.: Hyper least general generalization and its application to higher-order concept learning. Tech. report, Keio University (1996)"},{"key":"23_CR6","unstructured":"Harao, M.: Analogical reasoning based on higher-order unification. In: ALT (1990)"},{"key":"23_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-85845-4_10","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"M. Hofmann","year":"2008","unstructured":"Hofmann, M., Kitzelmann, E., Schmid, U.: Analysis and evaluation of inductive programming systems in a higher-order framework. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol.\u00a05243, pp. 78\u201386. Springer, Heidelberg (2008)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Huet, G.: A unification algorithm for typed \u03bbcalculus. Theor. Comp. Sci. (1975)","DOI":"10.1016\/0304-3975(75)90011-0"},{"key":"23_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-08406-9","volume-title":"Logic for Learning","author":"J.W. Lloyd","year":"2003","unstructured":"Lloyd, J.W.: Logic for Learning. Springer, Berlin (2003)"},{"issue":"1","key":"23_CR10","first-page":"39","volume":"57","author":"D. Malerba","year":"2003","unstructured":"Malerba, D.: Learning recursive theories in the normal ILP setting. Fundam. Inform.\u00a057(1), 39\u201377 (2003)","journal-title":"Fundam. Inform."},{"key":"23_CR11","unstructured":"Miller, D.: \u03bbProlog: An Introduction to the Language and its Logic (1998)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S.H. Muggleton","year":"1995","unstructured":"Muggleton, S.H.: Inverse entailment and Progol. New Generation Computing\u00a013, 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Nadathur, G., Miller, D.: Higher-order Horn Clauses. Journal of the ACM (1990)","DOI":"10.1145\/96559.96570"},{"issue":"1-3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10472-009-9136-7","volume":"54","author":"K.S. Ng","year":"2008","unstructured":"Ng, K.S., Lloyd, J.W., Uther, W.T.B.: Probabilistic modelling, inference and learning using logical theories. Ann. Math. Artif. Intell.\u00a054(1-3), 159\u2013205 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"23_CR15","unstructured":"Pahlavi, N., Muggleton, S.: Higher-order Logic Learning. In: ILP 2009, Poster (2009)"},{"key":"23_CR16","unstructured":"Pahlavi, N.: \u03bbProgol Homepage, http:\/\/www.doc.ic.ac.uk\/~namdp05\/"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Wolfram, D.A.: A semantics for \u03bbProlog. Theor. Comp. Sci., 277\u2013289 (1994)","DOI":"10.1016\/0304-3975(93)00130-W"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21295-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:35Z","timestamp":1606168955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21295-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212949","9783642212956"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21295-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}