{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T12:10:08Z","timestamp":1752149408266,"version":"3.41.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1010971904477","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:10:54Z","timestamp":1040598654000},"page":"211-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On Exact Learning of Unordered Tree Patterns"],"prefix":"10.1007","volume":"44","author":[{"given":"Thomas R.","family":"Amoth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Cull","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Tadepalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"351848_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/279943.279980","volume-title":"Proceedings of the Eleventh Annual Conference on Computational Learning Theory","author":"T. R. Amoth","year":"1998","unstructured":"Amoth, T. R., Cull, P., & Tadepalli, P. (1998). Exact learning of tree patterns from queries and counterexamples. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, (pp. 175\u2013186). New York, NY: ACM."},{"key":"351848_CR2","first-page":"323","volume-title":"Proceedings of the Twelth Annual Conference on Computational Learning Theory","author":"T. R. Amoth","year":"1999","unstructured":"Amoth, T. R., Cull, P., & Tadepalli. P. (1999). Exact learning of unordered tree patterns from queries. In Proceedings of the Twelth Annual Conference on Computational Learning Theory (pp. 323\u2013332). New York, NY: ACM."},{"key":"351848_CR3","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D. (1980). Finding patterns common to a set of strings. J. of Comp. and Syst. Sciences, 21, 46\u201362.","journal-title":"J. of Comp. and Syst. Sciences"},{"issue":"4","key":"351848_CR4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1022821128753","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2:4, 319\u2013342.","journal-title":"Machine Learning"},{"key":"351848_CR5","doi-asserted-by":"crossref","unstructured":"Arimura, H., Ishizaka. H., & Shinohara, T. (1995). Learning unions of tree patterns using queries'. In Proceedings of the 6th ALT (Algorithmic Learning Theory) (pp. 66\u201379). SpringerVerlag. Lecture Notes in Artificial Intelligence 997.","DOI":"10.1007\/3-540-60454-5_29"},{"issue":"1","key":"351848_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L. De Raedt","year":"1997","unstructured":"De Raedt, L. (1997). Logical settings for concept learning. Artificial Intelligence, 95:1, 187\u2013201.","journal-title":"Artificial Intelligence"},{"key":"351848_CR7","volume-title":"Computers and Intractability: A Guide to Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and Intractability: A Guide to Theory of NP-completeness. New York, NY: W.H. Freeman."},{"key":"351848_CR8","doi-asserted-by":"crossref","unstructured":"Goldman, S. A., & Kwek, S. S.(1999). On learning unions of pattern languages and tree patterns. In Proceedings of the 10th ALT (Algorithmic Learning Theory) (pp. 347\u2013363). Springer Verlag. Lecture Notes in Artificial Intelligence 1720.","DOI":"10.1007\/3-540-46769-6_29"},{"issue":"2","key":"351848_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(87)90103-7","volume":"24","author":"G. Gottlob","year":"1987","unstructured":"Gottlob, G. (1987). Subsumption and implication. Information Processing Letters, 24:2, 109\u2013111.","journal-title":"Information Processing Letters"},{"issue":"4\u20136","key":"351848_CR10","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/234752.234755","volume":"43","author":"L. Hellerstein","year":"1996","unstructured":"Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V., & Wilkins, D. (1996). How many queries are needed to learn?. Journal of the Association for Computing Machinery, 43:4\u20136, 840\u2013862.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"351848_CR11","first-page":"384","volume-title":"Proceedings of the Seventh International Conference on Machine Learning","author":"K.-I. Ko","year":"1990","unstructured":"Ko, K.-I., Marron, A., & Tzeng, W.-G. (1990). Learning string patterns and tree patterns from examples. In B.W. Porter, & R. J. Mooney (Eds.), Proceedings of the Seventh International Conference on Machine Learning (pp. 384\u2013391). San Mateo, CA: Morgan Kaufmann."},{"key":"351848_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"Lange, S., & Wiehagen, R. (1991). Polynomial-time inference of arbitrary pattern languages. New Generation Computing, 8, 361\u2013370.","journal-title":"New Generation Computing"},{"key":"351848_CR13","volume-title":"Anti-unification in constraint logics: Foundations and applications to learnability in first-order logic, to speed-up learning, and to deduction","author":"C. D. Page","year":"1993","unstructured":"Page, C. D. (1993). Anti-unification in constraint logics: Foundations and applications to learnability in first-order logic, to speed-up learning, and to deduction. Ph.D. Thesis, University of Illinois, Urbana, IL."},{"key":"351848_CR14","volume-title":"Inductive Logic Programming","author":"C. D. Page","year":"1992","unstructured":"Page, C. D., & Frisch, A. M. (1992). Generalization and learnability: A study of constrained atoms. In S. H. Muggleton (Ed.), Inductive Logic Programming. London: Academic Press."},{"key":"351848_CR15","volume-title":"Machine intelligence","author":"G. Plotkin","year":"1970","unstructured":"Plotkin, G. (1970). A Note on inductive generalization. In B. Meltzer, & D. Michie (Eds.), Machine intelligence (Vol. 5). New York, NY: Elsevier North-Holland."},{"issue":"1","key":"351848_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF03037583","volume":"17","author":"C. Reddy","year":"1999","unstructured":"Reddy, C., & Tadepalli, P. (1999). Learning horn definitions: Theory and an application to planning. New Generation Computing, 17:1, 77\u201398.","journal-title":"New Generation Computing"},{"key":"351848_CR17","first-page":"122","volume-title":"Conference on Computational Learning Theory","author":"R. E. Schapire","year":"1990","unstructured":"Schapire, R. E. (1990). Pattern languages are not learnable. In Conference on Computational Learning Theory (pp. 122\u2013129). San Mateo, CA: Morgan Kaufmann."},{"issue":"11","key":"351848_CR18","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L. (1984). A Theory of the learnable. Communications of the ACM, 27:11, 1134\u20131142.","journal-title":"Communications of the ACM"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010971904477.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1010971904477\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010971904477.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:43:19Z","timestamp":1752147799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1010971904477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["351848"],"URL":"https:\/\/doi.org\/10.1023\/a:1010971904477","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2001,9]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}