{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:12:54Z","timestamp":1648573974326},"reference-count":36,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":8357,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0743-1066(90)90041-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"221-233","source":"Crossref","is-referenced-by-count":2,"title":["Models of inductive synthesis"],"prefix":"10.1016","volume":"9","author":[{"given":"E.B.","family":"Kinber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.N.","family":"Brazma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(90)90041-3_BIB1","first-page":"455","article-title":"Inductive Inference of Automata, Functions and Programs","volume":"Vol. 2","author":"Barzdin","year":"1974","journal-title":"Proceedings of the International Congress of Mathematicians"},{"issue":"3","key":"10.1016\/0743-1066(90)90041-3_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"Inductive Inference: Theory and Methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Comput. Surveys"},{"key":"10.1016\/0743-1066(90)90041-3_BIB3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","article-title":"Research in the Theory of Inductive Inference by GDR Mathematicians\u2014a Survey","volume":"22","author":"Klette","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0743-1066(90)90041-3_BIB4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSE.1976.233812","article-title":"Constructing Programs from Example Computations","volume":"SE-2","author":"Biermann","year":"1976","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0743-1066(90)90041-3_BIB5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(86)90029-0","article-title":"Generalized Regular Expressions\u2014a Language for Synthesis of Programs with Branching in Loops","volume":"46","author":"Brazma","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(90)90041-3_BIB6","first-page":"173","article-title":"A Language for Non-linear Program Synthesis Containing While-Loops","author":"Brazma","year":"1985","journal-title":"Colloquium \u201cAn Intelligence Formalization: Semiotical Aspects\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB7","first-page":"32","article-title":"Inductive Inference of Programs","author":"Brazma","year":"1985","journal-title":"Problems Of Theoretical Cybernetics"},{"key":"10.1016\/0743-1066(90)90041-3_BIB8","series-title":"Information Processing '83","first-page":"333","article-title":"Some Rules of Inductive Inference and Their Use for Program Synthesis","author":"Barzdin","year":"1983"},{"key":"10.1016\/0743-1066(90)90041-3_BIB9","first-page":"156","article-title":"An Approach to the Problem of Inductive Inference","author":"Barzdin","year":"1983","journal-title":"Colloquium \u201cApplication of Mathematical Logic\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB10","first-page":"103","article-title":"The Decidability of the Equivalence Problem for Graphical Expressions","author":"Brazma","year":"1986","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB11","first-page":"234","article-title":"On Inductive Synthesis of Programs","volume":"Vol. 122","author":"Barzdin","year":"1981","journal-title":"Lecture Notes Comput. Sci."},{"key":"10.1016\/0743-1066(90)90041-3_BIB12","unstructured":"Etmane, I., An Experimental System for Presentation of Sample and Synthesis of Programs by Examples (in Russian), No. IPO 017, Latvian State Univ.\u2014Latvian Algorithm and Program Fund."},{"key":"10.1016\/0743-1066(90)90041-3_BIB13","first-page":"156","article-title":"Inductive Synthesis of Graphical Expressions","author":"Brazma","year":"1986","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB14","first-page":"81","article-title":"Inductive Synthesis of Programs: The State, Problems, Perspectives","author":"Barzdin","year":"1987","journal-title":"Kybernetica"},{"key":"10.1016\/0743-1066(90)90041-3_BIB15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language Identification in the Limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0743-1066(90)90041-3_BIB16","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","article-title":"Some Decidability Results in Grammatical Inference","volume":"20","author":"Feldman","year":"1972","journal-title":"Inform. and Control"},{"key":"10.1016\/0743-1066(90)90041-3_BIB17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a Mathematical Theory of Inductive Inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/0743-1066(90)90041-3_BIB18","first-page":"93","article-title":"Limes-Erkennung Rekursiver Funktionen durch Spezielle Stratigen","volume":"12","author":"Wiehagen","year":"1976","journal-title":"EIK"},{"key":"10.1016\/0743-1066(90)90041-3_BIB19","first-page":"68","article-title":"A Comparison of Different Types of Inductive Function Synthesis and Prognostication","volume":"Vol. 1","author":"Podnieks","year":"1974","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"issue":"3","key":"10.1016\/0743-1066(90)90041-3_BIB20","first-page":"521","article-title":"On Prognostication of General Recursive Functions","volume":"206","author":"Barzdin","year":"1972","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0743-1066(90)90041-3_BIB21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of Identification Criteria for Machine Inductive Inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(90)90041-3_BIB22","first-page":"101","article-title":"Prognostication and Synthesis in the Limit of Effectively Enumerable Function Classes","volume":"Vol. 1","author":"Barzdin","year":"1974","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB23","first-page":"112","article-title":"Synthesis in the Limit of \u03c4-Indices","volume":"Vol. 1","author":"Barzdin","year":"1974","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB24","first-page":"117","article-title":"On Speed-up of Function Synthesis and Prognostication","volume":"Vol. 1","author":"Barzdin","year":"1974","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"issue":"7\/8","key":"10.1016\/0743-1066(90)90041-3_BIB25","first-page":"369","article-title":"On Limiting Recursive Function Identification Speed-up by Changing Sequence of Questions","volume":"13","author":"Kinber","year":"1977","journal-title":"EIK"},{"issue":"4","key":"10.1016\/0743-1066(90)90041-3_BIB26","first-page":"812","article-title":"On Limiting Synthesis of General Recursive Function Numbers in Different Computable Enumerations","volume":"219","author":"Freivald","year":"1974","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0743-1066(90)90041-3_BIB27","first-page":"3","article-title":"Possibilities of General Limiting Recursive Function Synthesis in Different Computable Numberings","volume":"Vol. 2","author":"Freivald","year":"1975","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB28","doi-asserted-by":"crossref","unstructured":"Freivald R. V., Kinber, E. B. and Wiehagen, R., Inductive Inference and Computable One-One Numbering, Z. Math. Logik Grundlag. Math. 28:463\u2013479.","DOI":"10.1002\/malq.19820282708"},{"key":"10.1016\/0743-1066(90)90041-3_BIB29","first-page":"221","article-title":"On Limiting Synthesis of Almost Minimal G\u00f6del Numbers","volume":"Vol. 1","author":"Kinber","year":"1974","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB30","doi-asserted-by":"crossref","unstructured":"Freivald, R. V., Minimal G\u00f6del Numbers and Their Identification in the Limit, in: Lecture Notes in Comput. Sci., Vol. 32, pp. 219\u2013225.","DOI":"10.1007\/3-540-07389-2_199"},{"key":"10.1016\/0743-1066(90)90041-3_BIB31","first-page":"3","article-title":"Limiting Identification of Minimal G\u00f6del Numbers","volume":"Vol. 3","author":"Freivald","year":"1977","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB32","first-page":"35","article-title":"On Limiting Identification of Minimal Numbers for Functions in Effectively Enumerable Classes","volume":"Vol. 3","author":"Kinber","year":"1977","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB33","first-page":"137","article-title":"On the Principal Capabilities of Probabilistic Algorithms in Inductive Inference","volume":"12","author":"Freivald","year":"1979","journal-title":"Semiotika i Inform."},{"key":"10.1016\/0743-1066(90)90041-3_BIB34","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(83)90067-1","article-title":"On the Power of Probabilistic Strategies in Inductive Inference","volume":"28","author":"Wiehagen","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(90)90041-3_BIB35","first-page":"129","article-title":"Prognostication and Limiting Synthesis of Finite Automata","volume":"Vol. 1","author":"Barzdin","year":"1974","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"},{"key":"10.1016\/0743-1066(90)90041-3_BIB36","first-page":"145","article-title":"A Note on the Synthesis of Programs from Histories of Their Behavior","volume":"Vol. 1","author":"Barzdin","year":"1974","journal-title":"Colloquium \u201cTheory of Algorithms and Programs\u201d"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106690900413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106690900413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:24:41Z","timestamp":1580901881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106690900413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":36,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0743106690900413"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(90)90041-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}