{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:41:35Z","timestamp":1742992895996,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752240"},{"type":"electronic","value":"9783540752257"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75225-7_25","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T08:46:43Z","timestamp":1192006003000},"page":"298-312","source":"Crossref","is-referenced-by-count":8,"title":["Exact Learning of Finite Unions of Graph Patterns from Queries"],"prefix":"10.1007","author":[{"given":"Rika","family":"Okada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010971904477","volume":"44","author":"T.R. Amoth","year":"2001","unstructured":"Amoth, T.R., Cull, P., Tadepalli, P.: On exact learning of unordered tree patterns. Machine Learning\u00a044, 211\u2013243 (2001)","journal-title":"Machine Learning"},{"key":"25_CR2","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":"25_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-45583-3_24","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"2001","unstructured":"Arimura, H., Sakamoto, H., Arikawa, S.: Efficient learning of semi-structured data from queries. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 315\u2013331. Springer, Heidelberg (2001)"},{"key":"25_CR4","series-title":"LNAI","first-page":"118","volume-title":"Proc. NIL-91","author":"H. Arimura","year":"1993","unstructured":"Arimura, H., Shinohara, T., Otsuki, S.: Polynomial time algorithm for finding finite unions of tree pattern languages. In: Proc. NIL-91. LNCS (LNAI), vol.\u00a0659, pp. 118\u2013131. Springer, Heidelberg (1993)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R.J. Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series parallel networks. J. Math. Anal. Appl.\u00a010, 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"25_CR6","unstructured":"Hirashima, H., Suzuki, Y., Matsumoto, S., Uchida, T., Nakamura, Y.: Polynomial time inductive inference of unions of two term tree languages. In: Proc. ILP 2006, pp. 92\u201394 (2006) (short papers)"},{"key":"25_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"25_CR8","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. ch. Two classical enumeration problems in graph theory. North-Holland Publishing Company (1979)"},{"key":"25_CR9","series-title":"LNAI","first-page":"212","volume-title":"Proc. ALT-97","author":"S. Matsumoto","year":"1997","unstructured":"Matsumoto, S., Hayashi, Y., Shoudai, T.: Polynomial time inductive inference of regular term tree languages from positive data. In: ALT 1997. LNCS (LNAI), vol.\u00a01316, pp. 212\u2013227. Springer, Heidelberg (1997)"},{"key":"25_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-36187-1_46","volume-title":"AI 2002: Advances in Artificial Intelligence","author":"S. Matsumoto","year":"2002","unstructured":"Matsumoto, S., Shoudai, T., Miyahara, T., Uchida, T.: Learning of finite unions of tree patterns with internal structured variables from queries. In: McKay, B., Slaney, J.K. (eds.) AI 2002: Advances in Artificial Intelligence. LNCS (LNAI), vol.\u00a02557, pp. 523\u2013534. Springer, Heidelberg (2002)"},{"key":"25_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-39624-6_13","volume-title":"Algorithmic Learning Theory","author":"S. Matsumoto","year":"2003","unstructured":"Matsumoto, S., Suzuki, Y., Shoudai, T., Miyahara, T., Uchida, T.: Learning of finite unions of tree patterns with repeated internal structured variables from queries. In: Gavald\u00e1, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol.\u00a02842, pp. 144\u2013158. Springer, Heidelberg (2003)"},{"key":"25_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-47887-6_35","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Miyahara","year":"2002","unstructured":"Miyahara, T., Suzuki, Y., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of frequent tag tree patterns in semistructured web documents. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 341\u2013355. Springer, Heidelberg (2002)"},{"key":"25_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45435-7_12","volume-title":"Computational Learning Theory","author":"Y. Suzuki","year":"2002","unstructured":"Suzuki, Y., Akanuma, R., Shoudai, T., Miyahara, T., Uchida, T.: Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 169\u2013184. Springer, Heidelberg (2002)"},{"key":"25_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/11536314_22","volume-title":"Inductive Logic Programming","author":"R. Takami","year":"2005","unstructured":"Takami, R., Suzuki, Y., Uchida, T., Shoudai, T., Nakamura, Y.: Polynomial time inductive inference of TTSP graph languages from positive data. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol.\u00a03625, pp. 366\u2013383. Springer, Heidelberg (2005)"},{"issue":"2","key":"25_CR15","first-page":"99","volume":"E78-D","author":"T. Uchida","year":"1995","unstructured":"Uchida, T., Shoudai, T., Miyano, S.: Parallel algorithm for refutation tree problem on formal graph systems. IEICE Transactions on Information and Systems\u00a0E78-D(2), 99\u2013112 (1995)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-540-72504-6_6","volume-title":"Proc. TAMC 2007","author":"H. Yamasaki","year":"2007","unstructured":"Yamasaki, H., Shoudai, T.: A polynomial time algorithm for finding linear interval graph patterns. In: Proc. TAMC 2007. LNCS, vol.\u00a04484, pp. 67\u201378. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75225-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T23:55:55Z","timestamp":1550966155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75225-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752240","9783540752257"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75225-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}