{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:08Z","timestamp":1725663968894},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:56:05Z","timestamp":1330260965000},"page":"111-122","source":"Crossref","is-referenced-by-count":3,"title":["Generalized unification as background knowledge in learning logic programs"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S. Arikawa","year":"1992","unstructured":"Arikawa, S., Shinohara, T., and Yamamoto, A., Learning Elementary Formal Systems, Theoretical Computer Science 95(1):97\u2013113 (1992).","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(88)90095-3","volume":"59","author":"P. G. Bosco","year":"1988","unstructured":"Bosco, P. G., Giovannetti, E., and Moiso, C., Narrowing vs. SLD-Resolution, Theoretical Computer Science 59(1,2):3\u201323 (1988).","journal-title":"Theoretical Computer Science"},{"key":"9_CR3","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:149\u2013176 (1988).","journal-title":"Artificial Intelligence"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"D\u017eeroski, S., Mugglton, S., and Russell, S., PAC-Learnability of Determinate Logic Programs, in Proceedings of the 5th Annual Workshop on Computational Learning Theory, 128\u2013135, Academic Press, 1992.","DOI":"10.1145\/130385.130399"},{"key":"9_CR5","unstructured":"Fribourg, L., Prolog with Simplification, in Proceedings of France-Japan Artificial Intelligence and Computer Science Symposium, 239\u2013266, ICOT, 1986."},{"key":"9_CR6","unstructured":"H\u00f6lldobler, S., From Paramodulation to Narrowing, in Kowalski, R. A. and Bowen, K. A. (eds.), Proceedings of the 5th International Conference and Symposium on Logic Programming, 327\u2013342, The MIT Press, 1988."},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","volume":"23","author":"G. Huet","year":"1982","unstructured":"Huet, G. and Hullot, J.-M., Proofs by Induction in Equational Theories, Journal of Computer and System Science 23(1):239\u2013226 (1982).","journal-title":"Journal of Computer and System Science"},{"key":"9_CR8","unstructured":"Jaffar, J., Lassez, J.-L., and Maher, M. J., Logic Programming Scheme, in DeGroot, D. and Lindstrom, G. (eds.), Logic Programming: Functions, Relations, and Equations, 441\u2013467, Prentice-Hall, 1986."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W., Foundations of Logic Programming: Second, Extended Edition, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"9_CR10","unstructured":"Miyano, S., Shinohara, A., and Shinohara, T., Which Classes of Elementary Formal Systems are Polynomial-time Learnable?, in S. Arikawa and A. Maruoka and T. Sato (ed.), Proceedings of the Second International Workshop on Algorithmic Learning Theory, 139\u2013150, JSAI, 1991."},{"key":"9_CR11","unstructured":"Miyano, S., Shinohara, A., and Shinohara, T., Learning Elementary Formal Sytems and an Application to Discovering Motifs in Proteins, Technical Report RIFIS-TR-CS-37, Research Institute of Fundamental Information Science, Kyushu University, 1991, revised 1993."},{"key":"9_CR12","unstructured":"Mugglton, S. and Frish, A. M., Efficient Induction of Logic Programs, in S. Arikawa and S. Goto and S. Ohsuga and T. Yokomori (ed.), Proceedings of the First International Workshop on Algorithmic Learning Theory, 368\u2013381, JSAI, 1990."},{"key":"9_CR13","unstructured":"Natarajan, B. K., Machine Learning: A Theoretical Approach, Morgan-Kaufmann, 1991."},{"key":"9_CR14","unstructured":"Page Jr., C. D. and Frish, A. M., Generalization and Learnability: A study of Constrained Atoms, in S. Mugglton (ed.), Inductive Logic Programming, 29\u201361, Academic Press, 1992."},{"key":"9_CR15","unstructured":"Plotkin, G. D., Building in Equational Theories, in Machine Intelligence 7, 132\u2013147, Edinburgh University Press, 1972."},{"key":"9_CR16","unstructured":"Sato, T. and Tamaki, H., Transformational Logic Program Synthesis, in Proceedings of International Conference on FGCS 1984, 195\u2013201, ICOT, 1984."},{"issue":"11","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G., A Theory of Learnable, Communications of the ACM 27(11):1134\u20131142 (1984).","journal-title":"Communications of the ACM"},{"key":"9_CR18","unstructured":"Yamamoto, A., A Theoretical Combination of SLD-Resolution and Narrowing, in Lassez, J.-L. (ed.), Proceedings of the 4th International Conference on Logic Programming, 470\u2013487, The MIT Press, 1987."},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(92)90022-U","volume":"13","author":"A. Yamamoto","year":"1992","unstructured":"Yamamoto, A., Procedural Semantics and Negative Information of Elementary Formal System, The Journal of Logic Programming 13(1):89\u201397 (1992).","journal-title":"The Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57370-4_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:07Z","timestamp":1605647527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}