{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:22Z","timestamp":1725664462230},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602170"},{"type":"electronic","value":"9783540447375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60217-8_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:50:36Z","timestamp":1330278636000},"page":"25-48","source":"Crossref","is-referenced-by-count":0,"title":["Error detecting in inductive inference"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[]},{"given":"Efim B.","family":"Kinber","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Wiehagen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"ANGLUIN, D. (1980), Inductive inference of formal languages from positive data, Information and Control 45, 117\u2013135.","journal-title":"Information and Control"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"ANGLUIN, D., and SMITH, C. H. (1983), Inductive inference: Theory and methods, Computing Surveys 15, 237\u2013269.","journal-title":"Computing Surveys"},{"key":"2_CR3","unstructured":"BARZDIN, J. (1971), Complexity and frequency solution of some algorithmically unsolvable problems, Doct. Diss., Novosibirsk State Univ. (Russian)."},{"key":"2_CR4","unstructured":"BARZDIN, J. (1974), Inductive inference of automata, functions and programs, in \u201cProceedings, International Congress of Mathematicians\u201d pp.455\u2013460."},{"key":"2_CR5","first-page":"1224","volume":"13","author":"J. Barzdin","year":"1972","unstructured":"BARZDIN, J., and FREIVALDS, R. (1972), On the prediction of general recursive functions, Soviet Math. Dokl. 13, 1224\u20131228.","journal-title":"Soviet Math. Dokl."},{"key":"2_CR6","first-page":"100","volume":"1","author":"J. Barzdin","year":"1974","unstructured":"BARZDIN, J., and FREIVALDS, R. (1974), Prediction and limit synthesis of recursively enumerable function classes, Theory of algorithms and programs, vol. 1, 100\u2013111 (Russian).","journal-title":"Theory of algorithms and programs"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"BLUM, L., and BLUM, M. (1975), Toward a mathematical theory of inductive inference, Information and Control 28, 125\u2013155.","journal-title":"Information and Control"},{"volume-title":"Technical Report Nr. 152","year":"1979","author":"J. Case","key":"2_CR8","unstructured":"CASE, J., and NGO MANGUELLE, S. (1979), Refinements of inductive inference by Popperian machines, Technical Report Nr. 152, Dept. of Computer Science, State Univ. of New York at Buffalo."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"CASE, J., and SMITH, C. (1983), Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25, 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"2_CR10","first-page":"26","volume":"2","author":"R. Freivalds","year":"1975","unstructured":"FREIVALDS, R., and BARZDIN, J. (1975), Relations between predictability and identifiability in the limit, Theory of algorithms and programs, vol.2, 26\u201334 (Russian).","journal-title":"Theory of algorithms and programs"},{"key":"2_CR11","unstructured":"FREIVALDS, R., KINBER, E. B., and WIEHAGEN, R. (199x), How inductive inference strategies discover their errors, Information and Computation (to appear)"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0890-5401(88)90019-3","volume":"79","author":"M. A. Fulk","year":"1988","unstructured":"FULK, M. A. (1988), Saving the phenomena: Requirements that inductive inference machines not contradict known data, Information and Computation 79, 193\u2013209.","journal-title":"Information and Computation"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"FULK, M. A. (1990), Robust separations in inductive inference, in \u201cProceedings, 31st IEEE Symposium on Foundations of Computer Science\u201d pp.405\u2013410.","DOI":"10.1109\/FSCS.1990.89560"},{"key":"2_CR14","unstructured":"FULK, M. A. (1991), personal communication to R. Wiehagen."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"GOLD, E. M. (1967), Language identification in the limit, Information and Control 10, 447\u2013474.","journal-title":"Information and Control"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF03037092","volume":"8","author":"K. P. Jantke","year":"1991","unstructured":"JANTKE, K. P. (1991), Monotonic and non-monotonic inductive inference, New Generation Computing 8, 349\u2013360.","journal-title":"New Generation Computing"},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","volume":"22","author":"R. Klette","year":"1980","unstructured":"KLETTE, R., and WIEHAGEN, R. (1980), Research in the theory of inductive inference by GDR mathematicians \u2014 a survey, Information Sciences 22, 149\u2013169.","journal-title":"Information Sciences"},{"key":"2_CR18","unstructured":"KUMMER, M. (1992), personal communication to E. B. Kinber."},{"volume-title":"Systems that learn: An introduction to learning theory for cognitive and computer scientists","year":"1986","author":"D. N. Osherson","key":"2_CR19","unstructured":"OSHERSON, D. N., STOB, M., and WEINSTEIN, S. (1986), \u201cSystems that learn: An introduction to learning theory for cognitive and computer scientists\u201d, MIT Press, Cambridge, Mass."},{"key":"2_CR20","first-page":"68","volume":"1","author":"K. Podnieks","year":"1974","unstructured":"PODNIEKS, K. (1974), Comparing various types of limit synthesis and prediction of functions, Theory of algorithms and programs, vol.1, 68\u201381 (Russian).","journal-title":"Theory of algorithms and programs"},{"key":"2_CR21","volume-title":"The logic of scientific discovery","author":"K. Popper","year":"1968","unstructured":"POPPER, K. (1968), \u201cThe logic of scientific discovery\u201d, 2nd ed. Harper Torch, New York.","edition":"2nd ed."},{"volume-title":"Theory of recursive functions and effective computability","year":"1967","author":"H. Rogers","key":"2_CR22","unstructured":"ROGERS, H. (1967), \u201cTheory of recursive functions and effective computability\u201d, McGraw-Hill, New York."},{"volume-title":"\u201cTheory of algorithms and programs\u201d, vol.1","year":"1974","key":"2_CR23","unstructured":"\u201cTheory of algorithms and programs\u201d, vol.1, 2, 3 (1974, 1975, 1977), J. Barzdin, Ed., Latvian State Univ., Riga (Russian)."},{"key":"2_CR24","first-page":"93","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"WIEHAGEN, R. (1976), Limes-Erkennung rekursiver Funktionen durch spezielle Strategien, Elektronische Informationsverarbeitung und Kybernetik 12, 93\u201399 (German).","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"volume-title":"Diss. B","year":"1978","author":"R. Wiehagen","key":"2_CR25","unstructured":"WIEHAGEN, R. (1978a), Zur Theorie der algorithmischen Erkennung, Diss. B, Sektion Mathematik, Humboldt-Univ. Berlin (German)."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"WIEHAGEN, R. (1978b) Characterization problems in the theory of inductive inference, in \u201cProceedings, Int. Coll. on Automata, Languages and Programming\u201d, G. Ausiello, C. B\u00f6hm, Eds., Lecture Notes in Computer Science 62, 494\u2013508.","DOI":"10.1007\/3-540-08860-1_37"},{"key":"2_CR27","unstructured":"WIEHAGEN, R. (1991), A thesis in inductive inference, in \u201cProceedings, First International Workshop Nonmonotonic and Inductive Logic\u201d 1990, J. Dix, K. P. Jantke, P. Schmitt, Eds., Lecture Notes in Artificial Intelligence 543, 184\u2013207."},{"key":"2_CR28","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/09528139408953785","volume":"6","author":"R. Wiehagen","year":"1994","unstructured":"WIEHAGEN, R., and ZEUGMANN, T. (1994), Ignoring data may be the only way to learn efficiently, Journal of Experimental and Theoretical Artificial Intelligence 6, 131\u2013144.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning for Knowledge-Based Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60217-8_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:53Z","timestamp":1605646553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60217-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602170","9783540447375"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-60217-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}