{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:15:13Z","timestamp":1725459313336},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540548696"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0038204","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:20:09Z","timestamp":1138202409000},"page":"388-402","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating programs formed by example: An informational heuristic"],"prefix":"10.1007","author":[{"given":"Ian H.","family":"Witten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David L.","family":"Maulsby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"Thinking with the teachable machine","author":"J.H. Andreae","year":"1977","unstructured":"Andreae, J.H. (1977) Thinking with the teachable machine. Academic Press, London."},{"key":"26_CR2","unstructured":"Andreae, P.M. (1984) \u201cConstraint limited generalization: acquiring procedures from examples,\u201d Proc. American Association of Artificial Intelligence National Conference, Austin, Texas; August."},{"issue":"1","key":"26_CR3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/TIT.1974.1055172","volume":"IT-20","author":"G.J. Chaitin","year":"1974","unstructured":"Chaitin, G.J. (1974) \u201cInformation-theoretic computational complexity,\u201d IEEE Trans Information Theory IT-20 (1): 10\u201315; January.","journal-title":"IEEE Trans Information Theory"},{"issue":"2","key":"26_CR4","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TIT.1984.1056889","volume":"IT-30","author":"J.G. Cleary","year":"1984","unstructured":"Cleary, J.G. and Witten, I.H. (1984) \u201cA comparison of enumerative and adaptive codes,\u201d IEEE Trans Information Theory IT-30 (2): 306\u2013315; March","journal-title":"IEEE Trans Information Theory"},{"key":"26_CR5","volume-title":"Research Report OSD-T8402","author":"D. Halbert","year":"1984","unstructured":"Halbert, D. (1984) \u201cProgramming by example.\u201d Research Report OSD-T8402, Xerox PARC, Palo Alto, California."},{"key":"26_CR6","unstructured":"Heise, R. and MacDonald, B.A. (1989) \u201cRobots acquiring tasks from examples\u201d Proc ITESM 2nd International Symposium on AI, Monterrey, Mexico."},{"key":"26_CR7","unstructured":"MacDonald, B. A. & Witten, I. H. (1987) \u201cProgramming computer controlled systems by nonexperts,\u201d Proceedings of the IEEE SMC Annual Conference, 432\u2013437. Alexandria, Virginia."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Maulsby, D.L., Kittlitz, K.A., & Witten, I.H. (1989) \u201cMetamouse: specifying graphical procedures by example,\u201d Proceedings of ACM SIGGRAPH, 127\u2013136. Boston, Massachusetts.","DOI":"10.1145\/74333.74346"},{"key":"26_CR9","volume-title":"Research Report","author":"D.L. Maulsby","year":"1990","unstructured":"Maulsby, D.L., Witten, I.H., Kittlitz, K.A. and Franceschin, V.G. (1990) \u201cInferring graphical procedures: the compleat Metamouse,\u201d Research Report, Department of Computer Science, University of Calgary, Canada."},{"key":"26_CR10","unstructured":"Maulsby, D.L. (1990) \u201cMetamouse and user programming by demonstration,\u201d SIGGRAPH Video Review, Issues 55\u201356."},{"key":"26_CR11","volume-title":"Research Report","author":"D.H. Mo","year":"1990","unstructured":"Mo, D.H. and Witten, I.H. (1990) \u201cLearning text editing tasks from examples: a procedural approach,\u201d Research Report, Department of Computer Science, University of Calgary, Canada."},{"key":"26_CR12","unstructured":"Myers, B.A. (1988) Creating user interfaces by demonstration. Academic Press."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Nix, R. (1984) \u201cEditing by example,\u201d Proc. ACM Symposium on Principles of Programming Languages: 186\u2013195. Salt Lake City, Utah; January.","DOI":"10.1145\/800017.800530"},{"key":"26_CR14","first-page":"523","volume-title":"Encyclopaedia of statistical sciences, Vol. 5","author":"J. Rissanen","year":"1985","unstructured":"Rissanen, J. (1985) \u201cMinimum description length principle,\u201d in Encyclopaedia of statistical sciences, Vol. 5, edited by E.S. Kotz and N.L. Johnson, pp. 523\u2013527. Wiley, New York."},{"key":"26_CR15","unstructured":"Waterman, D., Faught, W., Klahr, P., Rosenschein, S. and Wesson, R. (1986) \u201cExemplary programming: applications and design considerations.\u201d In Expert systems: techniques, tools and applications, edited by P. Klahr and D. Waterman, pp. 273\u2013309. Addison-Wesley."},{"issue":"6","key":"26_CR16","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I.H. Witten","year":"1987","unstructured":"Witten, I.H., Neal, R., Cleary, J.G. (1987) \u201cArithmetic coding for data compression,\u201d Communications of the ACM 30 (6): 520\u2013540; June.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","New Results and New Trends in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0038204.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:23:05Z","timestamp":1607552585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0038204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540548696"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0038204","relation":{},"subject":[]}}