{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:42:02Z","timestamp":1725489722071},"publisher-location":"Dordrecht","reference-count":25,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402061264"},{"type":"electronic","value":"9781402061271"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-1-4020-6127-1_2","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T08:00:48Z","timestamp":1187596848000},"page":"27-54","source":"Crossref","is-referenced-by-count":0,"title":["Inductive Inference Systems for Learning Classes of Algorithmically Generated Sets and Structures"],"prefix":"10.1007","author":[{"given":"Valentina S.","family":"Harizanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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. (1980). \u201cInductive Inference of Formal Languages from Positive Data\u201d, Information and Control 45, 117\u2013135.","journal-title":"Information and Control"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jcss.1995.1066","volume":"51","author":"G. Baliga","year":"1995","unstructured":"Baliga, G., Case, J. and Jain, S. (1995). \u201cLanguage Learning with Some Negative Information\u201d, Journal of Computer and System Sciences 51, 273\u2013285.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR3","doi-asserted-by":"publisher","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). \u201cToward a Mathematical Theory of Inductive Inference\u201d, Information and Control 28, 125\u2013155.","journal-title":"Information and Control"},{"key":"2_CR4","unstructured":"Case, J. and Lynes, C. (1982). \u201cMachine Inductive Inference and Language Identification\u201d, in Nielsen, M. and Schmidt, E.M. [18], 107\u2013115."},{"key":"2_CR5","doi-asserted-by":"publisher","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). \u201cComparison of Identification Criteria for Machine Inductive Inference\u201d, Theoretical Computer Science 25, 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Numao, M. and Reischuk, R. (eds.) (2002). Algorithmic Learning Theory: 13th International Conference, Lecture Notes in Artificial Intelligence 2533, Berlin: Springer-Verlag.","DOI":"10.1007\/3-540-36169-3"},{"key":"2_CR7","unstructured":"Downey, R.G. and Remmel, J.B. (1998). \u201cComputable Algebras and Closure Systems: Coding Properties\u201d, in Ershov, Yu.L., Goncharov, S.S., Nerode, A. and Remmel, J.B. [8], 977\u20131039."},{"key":"2_CR8","unstructured":"Ershov, Yu.L., Goncharov, S.S., Nerode, A. and Remmel, J.B. (eds.) (1998). Handbook of Recursive Mathematics 2, Amsterdam: Elsevier."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M. (1967). \u201cLanguage Identification in the Limit\u201d, Information and Control 10, 447\u2013474.","journal-title":"Information and Control"},{"volume-title":"Handbook of Computability Theory","year":"1999","key":"2_CR10","unstructured":"Griffor, E.R. (ed.) (1999). Handbook of Computability Theory, Amsterdam: Elsevier."},{"key":"2_CR11","unstructured":"Harizanov, V.S. and Stephan, F. (2002). \u201cOn the Learnability of Vector Spaces\u201d, in Cesa-Bianchi, N., Numao, M. and Reischuk, R. [6], 233\u2013247."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0890-5401(03)00082-8","volume":"185","author":"S. Jain","year":"2003","unstructured":"Jain, S. and Stephan, F. (2003). \u201cLearning by Switching Type of Information\u201d, Information and Computation 185, 89\u2013104.","journal-title":"Information and Computation"},{"key":"2_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems That Learn: An Introduction to Learning Theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D.N., Royer, J.S. and Sharma, A. (1999). Systems That Learn: An Introduction to Learning Theory, 2nd ed., Cambridge (Mass.): MIT Press.","edition":"2nd ed"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"481","DOI":"10.2307\/2271869","volume":"42","author":"I. Kalantari","year":"1977","unstructured":"Kalantari, I. and Retzlaff, A. (1977). \u201cMaximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces\u201d, Journal of Symbolic Logic 42, 481\u2013491.","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR15","volume-title":"Commutative Rings","author":"I. Kaplansky","year":"1974","unstructured":"Kaplansky, I. (1974). Commutative Rings, Chicago: The University of Chicago Press."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0003-4843(77)90015-8","volume":"11","author":"G. Metakides","year":"1977","unstructured":"Metakides, G. and Nerode, A. (1977). \u201cRecursively Enumerable Vector Spaces\u201d, Annals of Mathematical Logic 11, 147\u2013171.","journal-title":"Annals of Mathematical Logic"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(91)90176-I","volume":"39","author":"T. Motoki","year":"1991","unstructured":"Motoki, T. (1991). \u201cInductive Inference from All Positive and Some Negative Data\u201d, Information Processing Letters 39, 177\u2013182.","journal-title":"Information Processing Letters"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Nielsen, M. and Schmidt, E.M. (eds.) (1982). Automata, Languages and Programming: Proceedings of the 9th International Colloquium, Lecture Notes in Computer Science 140, Berlin: Springer-Verlag.","DOI":"10.1007\/BFb0012751"},{"key":"2_CR19","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P. (1989). Classical Recursion Theory, Amsterdam: North-Holland."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"D.N. Osherson","year":"1982","unstructured":"Osherson, D.N. and Weinstein, S. (1982). \u201cCriteria of Language Learning\u201d, Information and Control 52, 123\u2013138.","journal-title":"Information and Control"},{"key":"2_CR21","volume-title":"Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D.N. Osherson","year":"1986","unstructured":"Osherson, D.N., Stob, M. and Weinstein, S. (1986). Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists, Cambridge (Mass.): MIT Press."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jcss.1998.1568","volume":"56","author":"A. Sharma","year":"1998","unstructured":"Sharma, A. (1998). \u201cA Note on Batch and Incremental Learnability\u201d, Journal of Computer and System Sciences 56, 272\u2013276.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR23","volume-title":"Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets","author":"R.I. Soare","year":"1987","unstructured":"Soare, R.I. (1987). Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Berlin: Springer-Verlag."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(00)00272-3","volume":"268","author":"F. Stephan","year":"2001","unstructured":"Stephan, F. and Ventsov, Yu. (2001). \u201cLearning Algebraic Structures from Text\u201d , Theoretical Computer Science 268, 221\u2013273.","journal-title":"Theoretical Computer Science"},{"key":"2_CR25","unstructured":"Stoltenberg-Hansen, V. and Tucker, J.V. (1999). \u201cComputable Rings and Fields\u201d, in Griffor, E.R. [10], 363\u2013447."}],"container-title":["Induction, Algorithmic Learning Theory, and Philosophy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-6127-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T01:51:17Z","timestamp":1629597077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-6127-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9781402061264","9781402061271"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-6127-1_2","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}