{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:50Z","timestamp":1725487070980},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540661092"},{"type":"electronic","value":"9783540487517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48751-4_21","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T21:42:59Z","timestamp":1183412579000},"page":"222-233","source":"Crossref","is-referenced-by-count":8,"title":["Discovering New Knowledge from Graph Data Using Inductive Logic Programming"],"prefix":"10.1007","author":[{"given":"Tetsuhiro","family":"Miyahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuji","family":"Kuboyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenichi","family":"Takahashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroaki","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,25]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"T. R. Amoth, P. Cull, and P. Tadepalli. Exact learning of tree patterns from queries and counterexamples. Proc. COLT-98, ACM Press, pages 175\u2013186, 1998.","DOI":"10.1145\/279943.279980"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S. Arikawa","year":"1992","unstructured":"S. Arikawa, T. Shinohara, and A. Yamamoto. Learning elementary formal systems. Theoretical Computer Science, 95:97\u2013113, 1992.","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"H. Arimura, H. Ishizaka, and T. Shinohara. Learning unions of tree patterns using queries. Proc. ALT-95, Springer-Verlag, LNAI 997, pages 66\u201379, 1995.","DOI":"10.1007\/3-540-60454-5_29"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"S. D\u017eeroski, N. Jacobs, M. Molina, C. Moure, S. Muggleton, and W. V. Laer. Detecting tra\u010d problems with ILP. Proc. ILP-98, Springer-Verlag, LNAI 1446, pages 281\u2013290, 1998.","DOI":"10.1007\/BFb0027332"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-18771-5_41","volume-title":"Proc. 3rd Graph-Grammars and Their Application to Computer Science","author":"A. Habel","year":"1987","unstructured":"A. Habel and H.-J. Kreowski. May we introduce to you: hyperedge replacement. Proc. 3rd Graph-Grammars and Their Application to Computer Science, Springer-Verlag, LNCS 291, pages 15\u201326, 1987."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg. On the structure of node-label-controlled graph languages. Information Sciences, 20:191\u2013216, 1980.","journal-title":"Information Sciences"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"S. Matsumoto, Y. Hayashi, and T. Shoudai. Polynomial time inductive inference of regular term tree languages from positive dat. Proc. ALT-97, Springer-Verlag, LNAI 1316, pages 212\u2013227, 1997.","DOI":"10.1007\/3-540-63577-7_45"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Uchida, T. Kuboyama, T. Yamamoto, K. Takahashi, and H. Ueda. KD-FGS: a knowledge discovery system from graph data using formal graph system. Proc. PAKDD-99, Springer-Verlag, LNAI 1574, (to appear), 1999.","DOI":"10.1007\/3-540-48912-6_58"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(95)91135-D","volume":"137","author":"Y. Mukouchi","year":"1995","unstructured":"Y. Mukouchi and S. Arikawa. Towards a mathematical theory of machine discovery from facts. Theoretical Computer Science, 137:53\u201384, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1137\/0206053","volume":"6","author":"S. Reyner","year":"1977","unstructured":"S. Reyner. An analysis of a good algorithm for the subtree problem. SIAM Journal on Computing, 6(4):730\u2013732, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR11","unstructured":"T. Uchida, T. Miyahara, and Y. Nakamura. Formal graph systems and node-label controlled graph grammars. Proc. 41th Inst. Syst. Control and Inf. Eng., pages 105\u2013106, 1997."},{"issue":"2","key":"21_CR12","first-page":"99","volume":"E78-D","author":"T. Uchida","year":"1995","unstructured":"T. Uchida, T. Shoudai, and S. Miyano. Parallel algorithm for refutation tree problem on formal graph systems. IEICE Trans. Inf. Syst., E78-D(2):99\u2013112, 1995.","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/69.298173","volume":"6","author":"J. T.-L. Wang","year":"1994","unstructured":"J. T.-L. Wang, K. Zhang, K. Jeong, and D. Shasha. A system for approximate tree matching. IEEE Trans. on Knowledge and Data Engineering, 6(4):559\u2013571, 1994.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(92)90022-U","volume":"13","author":"A. Yamamoto","year":"1992","unstructured":"A. Yamamoto. Procedural semantics and negative information of elementary formal system. Journal of Logic Programming, 13:89\u201398, 1992.","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48751-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:55:04Z","timestamp":1556574904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48751-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540661092","9783540487517"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48751-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}