{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:08:29Z","timestamp":1736140109268,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540541314"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019361","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:26:33Z","timestamp":1132637193000},"page":"253-285","source":"Crossref","is-referenced-by-count":4,"title":["Inductive synthesis of term rewriting systems"],"prefix":"10.1007","author":[{"given":"Guntis","family":"Barzdins","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"D.Angluin, Easily inferred sequences, Memorandum No. ERL-M499, University of California, 1974."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"D. Angluin and C.H. Smith, Inductive Inference: Theory and Methods, Computing Surveys 15, 237\u2013264, 1983.","journal-title":"Computing Surveys"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin, Finding patterns common to a set of strings, J.Comput. Syst. Sci., 21, 46\u201362, 1980.","journal-title":"J.Comput. Syst. Sci."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"J.M.Barzdin and G.J.Barzdin, Rapid construction of algebraic axioms from samples, (Will appear in North-Holland) 1990.","DOI":"10.1016\/0304-3975(91)90307-N"},{"key":"9_CR5","first-page":"328","volume":"397","author":"G. Barzdin","year":"1989","unstructured":"G. Barzdin, Inductive synthesis of encoding for algebraic data types, Lect. Notes Artif. Intelligence 397, 328\u2013338, 1989.","journal-title":"Lect. Notes Artif. Intelligence"},{"key":"9_CR6","first-page":"333","volume-title":"Information Processing 83","author":"J.M. Barzdin","year":"1983","unstructured":"J.M. Barzdin, Some rules of inductive inference and their use for program synthesis, Information Processing 83, 333\u2013338, Amsterdam, North-Holland, 1983."},{"key":"9_CR7","unstructured":"L.G.Bouma and H.R.Walters, Implementing algebraic specifications, Algebraic specification, ACM Press frontier series,. 1989."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSE.1976.233812","volume":"2","author":"A.W. Biermann","year":"1976","unstructured":"A.W. Biermann and R. Krishnaswamy, Constructing programs from example computations, IEEE Trans.Software Eng. 2, 141\u2013153, 1976.","journal-title":"IEEE Trans.Software Eng."},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TSMC.1978.4310035","volume":"8","author":"A.W. Biermann","year":"1978","unstructured":"A.W. Biermann, The inference of regular LISP programs from examples, IEEE Trans. Systems Man Cybernet. 8, 585\u2013600, 1978.","journal-title":"IEEE Trans. Systems Man Cybernet"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(86)90029-0","volume":"46","author":"A. Brazma","year":"1986","unstructured":"A. Brazma and E.B. Kinber, Generalized regular expressions \u2014 a language for synthesis of programs with branching in loops, Theor. Comp. Sci. 46, 175\u2013195, 1986.","journal-title":"Theor. Comp. Sci."},{"key":"9_CR11","first-page":"524","volume-title":"Information Processing 71","author":"S. Crespi-Reghizzi","year":"1972","unstructured":"S. Crespi-Reghizzi, An effective model for grammar inference, Information Processing 71, New York, North-Holland, 524\u2013529, 1972."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, Termination of Rewriting, Symbolic Computation 3, 69\u2013116, 1987.","journal-title":"Symbolic Computation"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M. Gold, Language identification in the limit, Information and control 10, 447\u2013474, 1967.","journal-title":"Information and control"},{"key":"9_CR14","first-page":"304","volume":"397","author":"S. Lange","year":"1989","unstructured":"S. Lange, Towards a set of inference rules for solving divergence in Knuth-Bendix completion, Lect. Notes Artificial Intelligence 397, 304\u2013316, 1989.","journal-title":"Lect. Notes Artificial Intelligence"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"E.Shapiro, Algorithmic program debugging, Cambridge(Mas.) MIT Press, 1983.","DOI":"10.7551\/mitpress\/1192.001.0001"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/321992.322002","volume":"24-1","author":"P.D. Summers","year":"1977","unstructured":"P.D. Summers, A Methodology for LISP program construction from examples, J. ACM 24-1, 161\u2013175, 1977.","journal-title":"J. ACM"},{"key":"9_CR17","first-page":"288","volume":"397","author":"M. Thomas","year":"1989","unstructured":"M. Thomas and K.P. Jantke, Inductive inference for solving divergence in Knuth-Bendix completion, Lect. Notes Artificial Intelligence 397, 288\u2013303, 1989.","journal-title":"Lect. Notes Artificial Intelligence"},{"key":"9_CR18","first-page":"104","volume":"397","author":"T. Yokomori","year":"1989","unstructured":"T. Yokomori, Learning context-free languages efficiently, Lect. Notes Artificial Intelligence 397, 104\u2013123, 1989.","journal-title":"Lect. Notes Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Baltic Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019361.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:49:15Z","timestamp":1736106555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540541314"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0019361","relation":{},"subject":[]}}