{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:54:16Z","timestamp":1725753256785},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449574"},{"type":"electronic","value":"9783642449581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44958-1_27","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T14:54:01Z","timestamp":1382453641000},"page":"339-350","source":"Crossref","is-referenced-by-count":0,"title":["Abstraction Super-Structuring Normal Forms: Towards a Theory of Structural Induction"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Silvescu","sequence":"first","affiliation":[]},{"given":"Vasant","family":"Honavar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Ayer, A.J.: Language, Truth, and Logic, 2nd edn. Gollancz, London (1936, 1946)","key":"27_CR1"},{"unstructured":"Burgin, M.: Super-Recursive Algorithms. Springer (2005)","key":"27_CR2"},{"unstructured":"Carnap, R.: An introduction to the Philosophy of Science. Basic Books (1966)","key":"27_CR3"},{"key":"27_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9783112316009","volume-title":"Syntactic Structures","author":"N. Chomsky","year":"1957","unstructured":"Chomsky, N.: Syntactic Structures. Mouton, The Hague (1957)"},{"key":"27_CR5","first-page":"81","volume":"6","author":"G. Elidan","year":"2005","unstructured":"Elidan, G., Friedman, N.: Learning Hidden Variable Networks: The Information Bottleneck Approach. Journal of Machine Learning Research (JMLR)\u00a06, 81\u2013127 (2005)","journal-title":"Journal of Machine Learning Research (JMLR)"},{"unstructured":"Hume, D.: An Enquiry Concerning Human Understanding. Hackett Publ. Co. (1993)","key":"27_CR6"},{"unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. EATCS. Springer (2005)","key":"27_CR7"},{"issue":"2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S.-Y. Kuroda","year":"1964","unstructured":"Kuroda, S.-Y.: Classes of languages and linear-bounded automata. Information and Control\u00a07(2), 207\u2013223 (1964)","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"Lauritzen, S.L.: Graphical Models. Clarendon Press, Oxford (1996)","key":"27_CR9","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"unstructured":"Oates, T., Armstrong, T., Harris, J., Nejman, M.: On the Relationship Between Lexical Semantics and Syntax for the Inference of Context-Free Grammars. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), pp. 431\u2013436 (2004)","key":"27_CR10"},{"unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann Publishers (1988)","key":"27_CR11"},{"unstructured":"Popper, K.R.: The Logic of Scientific Discovery, English ed. Basic Books (1934, 1959)","key":"27_CR12"},{"doi-asserted-by":"crossref","unstructured":"Salomaa, A.: Computation and Automata. Cambridge University Press (1985)","key":"27_CR13","DOI":"10.1017\/CBO9781107325630"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1137\/0202014","volume":"2","author":"W. Savitch","year":"1973","unstructured":"Savitch, W.: How to make arbitrary grammars look like context-free grammars. SIAM Journal on Computing\u00a02, 174\u2013182 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1007383707642","volume":"28","author":"J. Schmidhuber","year":"1997","unstructured":"Schmidhuber, J., Zhao, J., Wiering, M.: Shifting Bias with Success Story Algorithm. Machine Learning\u00a028, 105\u2013130 (1997)","journal-title":"Machine Learning"},{"issue":"1","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A Formal Theory of Inductive Inference, Part I. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"27_CR17","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A Formal Theory of Inductive Inference, Part II. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"issue":"42","key":"27_CR18","first-page":"230","volume":"2","author":"A. Turing","year":"1936","unstructured":"Turing, A.: On computable numbers with an application to the Entscheuidungs-problem. Proc. Lond. Math. Soc.\u00a02(42), 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"unstructured":"Silvescu, A., Honavar, V.: Abstraction Super-structuring Normal Forms: Towards a Computationalist Theory of Structural Induction. Technical Report. Department of Computer Science. Iowa State University (2011), http:\/\/arxiv.org\/abs\/1107.0434","key":"27_CR19"},{"doi-asserted-by":"crossref","unstructured":"Wallace, Dowe: Minimum Message Length and Kolmogorov complexity. Computer Journal (1999)","key":"27_CR20","DOI":"10.1093\/comjnl\/42.4.270"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44958-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T20:43:18Z","timestamp":1716064998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}