{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:08Z","timestamp":1725486248451},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429562"},{"type":"electronic","value":"9783540456506"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45650-3_30","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T21:48:45Z","timestamp":1180907325000},"page":"350-364","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Derivation for Elementary Formal Systems Based on Partial Unification"],"prefix":"10.1007","author":[{"given":"Noriko","family":"Sugimoto","sequence":"first","affiliation":[]},{"given":"Hiroki","family":"Ishizaka","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"issue":"6","key":"30_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho and M. J. Corasick: Efficient string matching: An aid to bibliographic search, Communication of the ACM 18, No.6, 333\u2013340 (1975).","journal-title":"Communication of the ACM"},{"key":"30_CR2","first-page":"405","volume":"E75-D","author":"S. Arikawa","year":"1992","unstructured":"S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara, and A. Yamamoto: Algorithmic learning theory with elementary formal systems, IEICE Transaction on Information and Systems E75-D, 405\u2013414 (1992).","journal-title":"IEICE Transaction on Information and Systems"},{"key":"30_CR3","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":"30_CR4","first-page":"89","volume":"IX","author":"N. Harada","year":"1997","unstructured":"N. Harada, S. Arikawa, and H. Ishizaka: A Class of elementary formal systems that has an efficient parsing algorithm, Information Modeling and Knowledge Bases IX, 89\u2013101 (1997).","journal-title":"Information Modeling and Knowledge Bases"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/78935.78938","volume":"37","author":"J. Jaffar","year":"1990","unstructured":"J. Jaffar: Minimal and complete word unification, Journal of the ACM 37, 47\u201385 (1990).","journal-title":"Journal of the ACM"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00245463","volume":"9","author":"D. Kapur","year":"1992","unstructured":"D. Kapur: Complexity of unification problems with associative-commutative operation, Journal of Automated Reasoning 9, 261\u2013288 (1992).","journal-title":"Journal of Automated Reasoning"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd: Foundations of logic programming (second edition), Springer-Verlag (1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"30_CR8","doi-asserted-by":"publisher","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"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF03037094","volume":"8","author":"T. Shinohara","year":"1991","unstructured":"T. Shinohara: Inductive inference on monotonic formal systems from positive data, New Generation Computing 8, 371\u2013384 (1991).","journal-title":"New Generation Computing"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1994.1006","volume":"108","author":"T. Shinohara","year":"1994","unstructured":"T. Shinohara: Rich classes inferable from positive data: Length-bounded elementary formal system, Information and Computation 108, 175\u2013186 (1994).","journal-title":"Information and Computation"},{"key":"30_CR11","doi-asserted-by":"crossref","DOI":"10.1515\/9781400882007","volume-title":"Theory of formal systems","author":"R. Smullyan","year":"1961","unstructured":"R. Smullyan: Theory of formal systems, Princeton Univ. Press, Princeton (1961)."},{"key":"30_CR12","unstructured":"N. Sugimoto, K. Hirata and H. Ishizaka: Constructive learning of translations based on dictionaries, In Proceedings of the Seventh International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1160, 177\u2013184(1996)."},{"key":"30_CR13","unstructured":"N. Sugimoto: Learnability of translations from positive examples, In Proceedings of the Ninth International Conference on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1501, 169\u2013178 (1998)."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0020-0190(99)00006-X","volume":"69","author":"N. Sugimoto","year":"1999","unstructured":"N. Sugimoto and H. Ishizaka: Generating languages by a derivation procedure for elementary formal systems, Information Processing Letters 69, 161\u2013166 (1999).","journal-title":"Information Processing Letters"},{"key":"30_CR15","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\u201397 (1992).","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45650-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T17:56:13Z","timestamp":1587578173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45650-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429562","9783540456506"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45650-3_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"20 December 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}