Generalization of Schemes/Programming by Analogy

Work on programming by analogy and generalization of abstract schemes from examples was started 1997 at Technical University Berlin, Department of Computer Science, Methods of AI Group and continued since 2000 at University of Osnabrück, Computer Science Group (of the Department of Mathematics and Computer Science) by Ute Schmid. Programming by analogy is part of a larger system which combines universal planning, generalization-to-n, analogical reasoning and abstraction for synthesis of recursive functions (IPAL).

Code

see [current implementation]

People

• current cooperation with Jochen Burghardt, Fraunhofer First, Berlin on anti-unification and analogy.
• Ute Schmid
  
• Ulrich Wagner (diploma student, finished 2002): Combinatorically Restricted Higher Order Anti-Unification. An Application to Programming by Analogy
  [Web-Page]
• Uwe Sinha (diploma student, finished 2000): Memory organization and retrieval of recursive program schemes: programming by type-based anti-unification
  thesis (postscript, in German) [Web-Page]
• Rene Mercy (diploma student, finished 1998): Programming by Analogy: Two algorithms for the adaptation of recursive program schemes
  thesis (postscript, in German)
• Mark Müller (diploma student, finished 1997): A type-based approach to analogical functional programming: Hierarchical Memory and type-based retrieval
  thesis (postscript, in German)
• Cognitive Psychology: Experiments about adaptation of non-isomorphic sources with Knuth Polkehn and Joachim Wirth (diploma theses, 1999); experiments on re-representation by Martin Mühlpfordt (diploma thesis, 1999). cooperation with Jaime Carbonell, CMU and Peter Gerjets, Uni Tübingen on derivational versus transformational analogy.

Papers

• Schmid, U., Wirth, J., and Polkehn, K. (in press). A Closer Look at Structural Similarity in Analogical Transfer. Cognitive Science Quareterly. [PDF, 30 pages]
• Kleinbeck, S., Gerjets, P., Scheiter, K., and Schmid, U. (2001). Einfluss derivationaler und transformationaler Beispielformate auf Beispielnutzung und Problemlöseleistung. In Proceedings der 43. Tagung experimentell arbeitender Psychologen. Regensburg: Universität Regensburg.
• Kleinbeck, S., Gerjets, P., Scheiter, K., and Schmid, U. (2001). Impact of different example formats on solving isomorphic and novel problems (Summarry). EARLI 2001.
• Schmid, U., Sinha, U., and Wysotzki, F. (2001). Program reuse and abstraction by anti-unification. In G. Stumme et al.: Professionelles Wissensmanagement -- Erfahrungen und Visionen (pp. 183-185). Shaker. (German Workshop of Case-Based Reasoning (GWCBR2001) im Rahmen der WM 2001, 15-16 March, Baden-Baden.) [Poster Abstract] [Full Paper, 12 pages]
• Schmid, U., Sinha, U., and Wysotzki, F. (2000). Generalizing Recursive Program Schemes with Anti-Unification (Abstract). Beiträge zum Fachgruppentreffen Maschinelles Lernen der GI Fachgruppe 1.1.3 (18.-20.09.00, GMD, St. Augustin). [Postscript, 2 pages]
• Schmid, U., Wirth, J., and Polkehn, K. (1999). Analogical Transfer of Non-Isomorphic Source Problems. In M. Hahn and S. C. Stoness (Eds.), Proceedings of the 21st Annual Conference of the Cognitive Science Society (August 19-21, 1999; Simon Fraser University, Vancouver, British Columbia), pages 631-636, Lawrence Erlbaum. [Postscript]
• Schmid, U., Wirth, J., and Polkehn, K. (1999). Analogical Transfer of Non-Isomorphic Source Problems. In I. Wachsmuth and B. Jung (Eds.), Proc. der 4. Fachtagung der Gesellschaft f. Kognitionswissenschaft (28.9. - 1.10.99, Bielefeld), pages 128-133. infix. (A shorter version of the CogSci'99 paper) [Postscript]
• Schmid, U. and Carbonell, J. (1999). Empirical Evidence for Derivational Analogy (Poster Abstract). In M. Hahn and S. C. Stoness (Eds.), Proceedings of the 21st Annual Conference of the Cognitive Science Society (August 19-21, 1999; Simon Fraser University, Vancouver, British Columbia), p. 814, Lawrence Erlbaum. [Abstract (PS)] [Long Version (PS)] [Poster (A1, postscript)]
• Schmid, U. and Carbonell, J. (1999). Empirical Evidence for Derivational Analogy. In I. Wachsmuth and B. Jung (Eds.), Proc. der 4. Fachtagung der Gesellschaft f. Kognitionswissenschaft (28.9. - 1.10.99, Bielefeld), pages 116-121. infix. [Postscript]
• Schmid, U. (1998). Structural characteristics for the adaptability of problems in analogical problem solving. Workshop ``Maschinelles Lernen und Konzepterwerb'' auf der KI-98 (15.-17.9.98, Bremen), Forschungsberichte des Fachbereichs Informatik, TU Berlin, 98-16, 43-50. [Postscript]
• Schmid, U., Mercy, R., and Wysotzki, F. (1998). Programming by analogy: Retrieval, mapping, adaptation and generalization of recursive program schemes. Beiträge zum Treffen der GI-Fachgruppe 1.1.3 Maschinelles Lernen, FGML-98 (17.--19.8.98, TU Berlin), Forschungsberichte des Fachbereichs Informatik, TU Berlin, 98/11, 140--147. [Postscript]
• Schmid, U. (1998). Adaptation of non-isomorphic sources in analogical problem solving. In: K. Holyoak, D. Gentner and B. Kokinov (Eds.), Proc. of the Workshop ``Advances in Analogy Research: Integration of Theory and Data from the Cognitive, Computational, and Neural Sciences'' (pp. 406-407), Sofia, 17-20 July 1998. NBU Series of Cognitive Science. [Poster Abstract] [Poster]
• Schmid, U. (1998). Analogical Problem Solving by Adaptation of Schemes. 2nd European Conference on Cognitive Modelling (ECCM-98), 1.-4.4. 1998, Nottingham, UK. [Extended Abstract] [Poster]
• Schmid, U. and Wysotzki, F. (1997). Induktion von rekursiven Programmschemata und analoges Lernen. In R. H. Kluwe (Hrsg.), Strukturen und Prozesse intelligenter Systeme. Wiesbaden: Deutscher Universitätsverlag, 197-214.
• Schmid, U. (1997). Programmieren durch analoges Schließen. Kognitionswissenschaft, Sonderheft "Analoges Schließen", 6 (3), 127-134.

Contact

(last modified march/07/2001 by schmid)