{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T17:33:52Z","timestamp":1720114432239},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0020-0255(91)90079-a","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"219-230","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Automated scientific discovery"],"prefix":"10.1016","volume":"57-58","member":"78","reference":[{"key":"10.1016\/0020-0255(91)90079-A_BIB1","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":"Information & Control"},{"key":"10.1016\/0020-0255(91)90079-A_BIB2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(91)90079-A_BIB3","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0020-0255(91)90079-A_BIB4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","article-title":"A general lower bound on the number of examples needed for learning","volume":"82","author":"Ehrenfeucht","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/0020-0255(91)90079-A_BIB5","doi-asserted-by":"crossref","unstructured":"H. Gaifman, D. Osherson, S. Weinstein, A reason for theoretical terms, Erkenntnis (in press).","DOI":"10.1007\/BF00217543"},{"key":"10.1016\/0020-0255(91)90079-A_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00269958","article-title":"Inductive inference in the limit","volume":"22","author":"Glymour","year":"1985","journal-title":"Erkenntnis"},{"key":"10.1016\/0020-0255(91)90079-A_BIB7","first-page":"447","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Information & Computation"},{"key":"10.1016\/0020-0255(91)90079-A_BIB8","series-title":"COLT 88: Proceedings of the 1988 Workshop on Computational Learning Theory, Morgan-Kaufmann","year":"1988"},{"key":"10.1016\/0020-0255(91)90079-A_BIB9","series-title":"COLT 89: Proceedings of the 2nd Annual Workshop on Computational Learning Theory, Morgan-Kaufmann","first-page":"384","article-title":"On the Complexity of Learning from Counterexamples","author":"Maas","year":"1989"},{"key":"10.1016\/0020-0255(91)90079-A_BIB10","series-title":"Truthlikeness","author":"Niiniluoto","year":"1987"},{"key":"10.1016\/0020-0255(91)90079-A_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF00250549","article-title":"Identification in the limit of first-order structures","volume":"15","author":"Osherson","year":"1986","journal-title":"Journal of Philosophical Logic"},{"key":"10.1016\/0020-0255(91)90079-A_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00296173","article-title":"Paradigms of truth detection","volume":"18","author":"Osherson","year":"1989","journal-title":"Journal of Philosophical Logic"},{"key":"10.1016\/0020-0255(91)90079-A_BIB13","series-title":"COLT 89: Proceedings of the 2nd Annual Workshop on Computational Learning Theory, Morgan-Kaufmann","first-page":"88","article-title":"On Approximate Truth","author":"Osherson","year":"1989"},{"key":"10.1016\/0020-0255(91)90079-A_BIB14","author":"Osherson","year":"1988","journal-title":"A Theory of Approximate Truth"},{"key":"10.1016\/0020-0255(91)90079-A_BIB15","doi-asserted-by":"crossref","unstructured":"D. Osherson, M. Stob, S. Weinstein, A Universal Inductive Inference Machine, Journal of Symbolic Logic, in press.","DOI":"10.2307\/2274708"},{"key":"10.1016\/0020-0255(91)90079-A_BIB16","series-title":"Mathematics, Matter and Method","article-title":"Probability and confirmation","author":"Putnam","year":"1975"},{"key":"10.1016\/0020-0255(91)90079-A_BIB17","series-title":"COLT 89: Proceedings of the Second Annual Workshop on Computational Learning Theory, Morgan-Kaufmann","year":"1989"},{"key":"10.1016\/0020-0255(91)90079-A_BIB18","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0020-0255(91)90079-A_BIB19","series-title":"Saturated Model Theory","author":"Sacks","year":"1972"},{"key":"10.1016\/0020-0255(91)90079-A_BIB20","series-title":"Proceedings of the Seventh International Joint Conference on Artificial Intellience, IJCAI","article-title":"An algorithm that infers theories from facts","author":"Shapiro","year":"1981"},{"key":"10.1016\/0020-0255(91)90079-A_BIB21_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Information & Control"},{"key":"10.1016\/0020-0255(91)90079-A_BIB21_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Information & Control"},{"key":"10.1016\/0020-0255(91)90079-A_BIB22","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Communications of the ACM"},{"key":"10.1016\/0020-0255(91)90079-A_BIB23","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190079A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190079A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:24:29Z","timestamp":1552901069000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559190079A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":24,"alternative-id":["002002559190079A"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(91)90079-a","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}