{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:14:20Z","timestamp":1740287660498,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410119"},{"type":"electronic","value":"9783540452577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-45257-7_20","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T22:05:01Z","timestamp":1278021901000},"page":"241-255","source":"Crossref","is-referenced-by-count":4,"title":["Identification of Tree Translation Rules from Examples"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Sakamoto","sequence":"first","affiliation":[]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"20_CR2","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-63577-7_59","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"1997","unstructured":"Arimura, H.: Learning Acyclic First-order Horn Sentences From Entailment. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol.\u00a01316, pp. 432\u2013445. Springer, Heidelberg (1997)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)00015-7","volume":"185","author":"H. Arimura","year":"1997","unstructured":"Arimura, H., Ishizaka, H., Shinohara, T.: Learning unions of tree patterns using queries. Theoretical Computer Science\u00a0185, 47\u201362 (1997)","journal-title":"Theoretical Computer Science"},{"key":"20_CR4","unstructured":"Bray, T., Paoli, J., Sperberg-McQueen, C.M.: Extensible Markup Language (XML) Version 1.0. W3C Recommendation (1998), http:\/\/www.w3.org\/TR\/REC-xml"},{"key":"20_CR5","unstructured":"Clark, J. (ed.): XSL Transformations (XSLT) Version 1.0. W3C Recommendation (1999), http:\/\/www.w3.org\/TR\/xslt"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: Formal Models and Semantics, Handbook of Theoretical Computer Science. vol.\u00a0B, ch. 6. Elsevier, Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"20_CR7","unstructured":"Drewes, F.: Computation by Tree Transductions, Ph D. Thesis, University of Bremen, Department of Mathematics and Informatics (February 1996)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Frazier, M., Pitt, L.: Learning from entailment: an application to propositional Horn sentences. In: Proc. 10th Int. Conf. Machine Learning, pp. 120\u2013127 (1993)","DOI":"10.1016\/B978-1-55860-307-3.50022-8"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-48686-0_43","volume-title":"Computing and Combinatorics","author":"K. Hirata","year":"1999","unstructured":"Hirata, K., Yamada, K., Harao, M.: Tractable and Intractable Second-Order Matching Problems. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 432\u2013441. Springer, Heidelberg (1999)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Khardon, R.: Learning function-free Horn expressions. In: Proc. COLT 1998, pp. 154\u2013165 (1998)","DOI":"10.1145\/279943.279976"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Kilpelainen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comput., 340\u2013356 (1995)","DOI":"10.1137\/S0097539791218202"},{"key":"20_CR12","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. Commun. ACM\u00a027, 1134\u20131142 (1984)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45257-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T13:53:24Z","timestamp":1740232404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45257-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410119","9783540452577"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45257-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}