{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:21Z","timestamp":1725560181064},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281771"},{"type":"electronic","value":"9783540318514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11536314_22","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:45:23Z","timestamp":1279723523000},"page":"366-383","source":"Crossref","is-referenced-by-count":6,"title":["Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data"],"prefix":"10.1007","author":[{"given":"Ryoji","family":"Takami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuaki","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Science\u00a021, 46\u201362 (1980)","journal-title":"Journal of Computer and System Science"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An n 5\/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput.\u00a02, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"22_CR4","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.) Canadian AI 2002. LNCS (LNAI), vol.\u00a02557, pp. 523\u2013534. Springer, Heidelberg (2002)"},{"key":"22_CR5","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":"Y. Matsumoto","year":"2003","unstructured":"Matsumoto, Y., Suzuki, S., 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":"22_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-48751-4_21","volume-title":"Inductive Logic Programming","author":"T. Miyahara","year":"1999","unstructured":"Miyahara, T., Shoudai, T., Uchida, T., Kuboyama, T., Takahashi, K., Ueda, H.: Discovering new knowledge from graph data using inductive logic programming. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 222\u2013233. Springer, Heidelberg (1999)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-44669-9_32","volume-title":"Fundamentals of Computation Theory","author":"T. Shoudai","year":"2001","unstructured":"Shoudai, T., Uchida, T., Miyahara, T.: Polynomial time algorithms for finding unordered tree patterns with internal variables. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 335\u2013346. Springer, Heidelberg (2001)"},{"key":"22_CR9","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)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. Journal of the Association for Computing Machinery\u00a029(3), 623\u2013641 (1982)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"22_CR11","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 Trans. Inf. Syst.\u00a0E78-D(2), 99\u2013112 (1995)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput.\u00a011, 298\u2013313 (1982)","journal-title":"SIAM J. Comput."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"van Leeuwen, J.: Handbook of theoretical computer science (vol. A): algorithms and complexity. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88071-0.50015-1"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11536314_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:39Z","timestamp":1605625899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11536314_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281771","9783540318514"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11536314_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}