{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:42Z","timestamp":1725664422453},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540618638"},{"type":"electronic","value":"9783540707196"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61863-5_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:29:04Z","timestamp":1330295344000},"page":"185-198","source":"Crossref","is-referenced-by-count":0,"title":["Inductive logic programming beyond logical implication"],"prefix":"10.1007","author":[{"given":"Jianguo","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Arima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"18_CR1","first-page":"12","volume-title":"NCARAI TR: AIC-94-024","author":"D.W. Aha","year":"1994","unstructured":"Aha, D.W., Lapointe, S., Ling, C.X. and Matwin, S., Learning recursive relations with randomly selected small training sets. In Proceedings of the Eleventh International Machine Learning Conference (pp. 12\u201318. New Brunswick, NJ: Morgan Kaufmann. 1994. (NCARAI TR: AIC-94-024)."},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"W. Buntine","year":"1988","unstructured":"Buntine, W., generalized subsumption and its applications to induction and redundancy, Artificial Intelligence, 36(2):149\u2013176, 1988.","journal-title":"Artificial Intelligence"},{"key":"18_CR3","unstructured":"Cypher,A. Ed., Watch What I Do: Programming by Demonstration, The MIT Press, 1993."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cohen,W.W. and Page Jr.,C.D., Polynomial Learnability and Inductive Logic Programming: Methods and Results, New Generation Computing, Ohmsha LTD. and Springer-Verlag, 13, 369\u2013409, 1995.","DOI":"10.1007\/BF03037231"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","volume":"70","author":"L. Raedt De","year":"1994","unstructured":"De Raedt, L. and Dzeroski, S., First-order jk-clausal theories are PAC-learnable, Artificial Intelligence, 70, 375\u2013392, 1994.","journal-title":"Artificial Intelligence"},{"key":"18_CR6","first-page":"145","volume":"1","author":"G. DeJong","year":"1986","unstructured":"DeJong, G. and Mooney, R.. Explanation-based generalization: an alternative view, Machine Learning, 1, 145\u2013176, 1986.","journal-title":"Machine Learning"},{"key":"18_CR7","unstructured":"Furukawa,K., Imai,M. and Goebel,R., Hyper least general generalization and its application to higher-order concept learning, draft."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Hagiya,M., Programming by example and proving by example using higherorder unification, 10th Conference on Automated Deduction (M. E. Stickel ed.), Lecture Notes in Artificial Intelligence, Vol. 448, 1990, pp.588\u2013602.","DOI":"10.1007\/3-540-52885-7_116"},{"key":"18_CR9","unstructured":"Idestam-Almquist,P., Generalization of Horn clauses, PhD Dissertation, Department of Computer Science and Systems Science, Stockholm University and the Royal Institute of Technology, 1993."},{"key":"18_CR10","volume-title":"Efficient Induction of Recursive Definitions by Structural Analysis of Saturations","author":"P. Idestam-Almquist","year":"1995","unstructured":"Idestam-Almquist, P., Efficient Induction of Recursive Definitions by Structural Analysis of Saturations, in Proceedings of the Fifth Workshop on Inductive Logic Programming (ILP95), Department of Computer Science, Katholieke Universiteit Leuven, Belgium, 1995."},{"key":"18_CR11","unstructured":"Lapointe,S., Ling,C. and Matwin,S., Constructive Inductive Logic Programming, Proceedings of The Third International Workshop on Inductive Logic Programming ILP'93 April 1\u20133, 1993 Bled, Slovenia. 255\u2013264."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W., Foundations of logic programming, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"18_CR13","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"1992","unstructured":"Muggleton, S. and Buntine W., Machine invention of first-order predicates by inverting resolution. In S. Muggleton, editor, Inductive Logic Programming, London, 1992. Academic Press."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Maher, M.J., Equivalence of logic programs, Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50020-8"},{"key":"18_CR15","volume-title":"Efficient induction of logic programs","author":"S. Muggleton","year":"1990","unstructured":"Muggleton, S. and Feng, C., Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, Tokyo., 1990. Ohmsha."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Marcinkowski,J. and Pacholski,L., Undecidability of the Horn clause implication problem. Proceedings of the 33 Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, 1992. 354\u2013362.","DOI":"10.1109\/SFCS.1992.267755"},{"issue":"20","key":"18_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S. and De Raedt, L., Inductive logic programming: theory and methods. Journal of Logic Programming, 19, 20:629\u2013679, 1994.","journal-title":"Journal of Logic Programming"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Muggleton,S., Inverting the resolution principle. In Machine Intelligence 12. Oxford University Press, 1991.","DOI":"10.1093\/oso\/9780198538233.003.0007"},{"key":"18_CR19","unstructured":"Miller,D., A logic programming language with lambda-abstraction, function variables, and simple unification, in Proceedings of the international workshop on Extensions of logic programming, Tubingen 1989. LCNS 475."},{"key":"18_CR20","unstructured":"Niblett,T., A study of generalization in logic programs, In Proceedings of the third European working session on learning, Pitman, 1988."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Numao,M., Maruoka,T. and Shimura, M., Inductively Speeding Up Logic Programs, Machine Intelligence 13, Oxford University Press 1994, pp. 371\u2013385.","DOI":"10.1093\/oso\/9780198538509.003.0017"},{"key":"18_CR22","unstructured":"Plotkin, G.D., A note on inductive generalization, Machine Intelligence 5, Edinburgh University Press 1970, pp. 153\u2013163."},{"key":"18_CR23","unstructured":"Plotkin, G.D., A further note on inductive generalization, Machine Intelligence 6, Edinburgh University Press 1971, pp. 101\u2013124."},{"issue":"20","key":"18_CR24","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A. Pettorossi","year":"1994","unstructured":"Pettorossi, A. and Proietti, M., Transformation of logic programs: foundations and techniques, J. Logic programming, 1994, 19(20), pp. 261\u2013320.","journal-title":"J. Logic programming"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1022678217288","volume":"14","author":"C. Rouveirol","year":"1994","unstructured":"Rouveirol, C., Flattening and saturation: two representation changes for generalization, Machine learning 14, pp. 219\u2013232, 1994.","journal-title":"Machine learning"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Rouveirol, C., Puget,J.F., Beyond inversion of resolution, in Bruce W. Porter and Ray J. Mooney(eds.) Machine learning: Proceedings of the seventh international conference on machine learning, 1990. Morgan Kaufmann. pp. 122\u2013130.","DOI":"10.1016\/B978-1-55860-141-3.50018-3"},{"key":"18_CR27","unstructured":"Tamaki,H., Sato,T., Unfold\/fold transformation of logic programs, in: S. A. Tarnlund (ed.), Proceedings of the 2nd international conference on logic programming, Uppsala, Sweden, 1984, pp. 127\u2013138."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61863-5_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:49:36Z","timestamp":1713635376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61863-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618638","9783540707196"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-61863-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}