Induktion von Rekursiven Programmschemata und Analoges Lernen

  • Ute Schmid
  • Fritz Wysotzki
Chapter
Part of the Studien zur Kognitionswissenschaft book series (SZKW)

Zusammenfassung

Sowohl in der kognitiven Psychologie, als auch in der Künstlichen Intelligenz wird unter dem Erwerb von Problemlösefertigkeiten im Allgemeinen der Aufbau von Regeln verstanden, die es ermöglichen, nachfolgende Probleme ohne aufwendige Such- und Inferenzprozesse („automatisch“) zu lösen (Anderson, 1983). Üblicherweise wird davon ausgegangen, daß Problemlösefertigkeiten im Problemlöseprozeß - also durch „learning by doing“ - erworben werden (Anderson et al. 1989). Anderson (Anderson, 1983) bezeichnet die Automatismen, die Problemlösefertigkeiten zugrundeliegen, auch als prozedurales Wissen (know how), das er mit deklarativem Wissen (know that) kontrastiert. Prozedurales Wissen wird üblicherweise durch Produktionsregeln repräsentiert. Wissen über die Struktur von Problemen kann deklarativ, zum Beispiel in Form von Schemata (frames) repräsentiert werden.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Anderson, J.R., Conrad, F.G., and Corbett, A.T. (1989). Skill acquisition and the LISP tutor. Cognitive Science, 13, 467–505.CrossRefGoogle Scholar
  2. Anderson, J.R. (1983). The Architecture of Cognition. Cambridge: Havard University Press, MA.Google Scholar
  3. Anderson, J.R. (1986). Knowledge compilation: A general learning mechanism. In Michalski, R.S., Carbonell, J.G. and Mitchell, T.M. (Eds.), Machine Learning-An Artificial Intelligence Approach, volume 2 (pp. 289-310). Tioga.Google Scholar
  4. Anderson, J.R. (1993). Rules of the Mind. Hillsdale, NJ: Lawrence Erlbaum.Google Scholar
  5. Anderson, J.R. and Thompson, R. (1989). Use of analogy in a production System architecture. In S. Vosniadou and A. Ortony, (Eds.), Similarity and Analogical Reasoning (pp. 267-297). Cambridge University Press.Google Scholar
  6. Bibel, W. and Biermann, A.W. (1993). Special issue: Automatic programming, foreword of the guest editors. Journal of Symbolic Computation, 15(5, 6), 463–465.CrossRefGoogle Scholar
  7. Burstall, R.M. and Darlington, J. (1977). A transformation system for developing recursive programs. JACM, 24(1), 44–67.CrossRefGoogle Scholar
  8. Biermann, A.W., Guiho, W. and Kodratoff, Y. (Eds.) (1984). Automatic Program Construction Techniques. Collier Macmillan.Google Scholar
  9. Buneman, P. and Levy, L. (1980). The tower of hanoi problem. Information Processing Letters, 10(4, 5), 243–244.CrossRefGoogle Scholar
  10. Carbonell, J.G. (1983). Learning by analogy: Formulating and generalizing plans from past experience. In Michalski, R.S., Carbonell, J.G. and Mitchell, T.M. (Eds.), Machine Learning-An Artificial Intelligence Approach, volume 1 (pp. 137–162). New York: Springer.Google Scholar
  11. Gentner, D. (1983). Structure-mapping: a theoretical framework for analogy. Cognitive Science, 7, 155–170.CrossRefGoogle Scholar
  12. Green, C. (1969). Application of theorem proving to problem solving. Technical report, IJCAI 1.Google Scholar
  13. Holyoak, K.J. and Thagard, P. (1989). Analogical mapping by constraint satisfaction. Cognitive Science, 13, 295–355.CrossRefGoogle Scholar
  14. Hopcroft, J.E. and Ullman, J.D. (1990). Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie. Bonn: Addison-Wesley.Google Scholar
  15. Jülisch, B. and Krause, W. (1976). Semantischer kontext und problemlöseprozesse. In Klix, F., (Eds.), Psychologische Beiträge zur Analyse kognitiver Prozesse (pp 274–301). Berlin: Deutscher Verlag der Wissenschaften, 274–301.Google Scholar
  16. Lowry, M. and Duran, R. (1989). Knowledge-based software engineering. In Cohen, P.R., Barr, A. and Feigenbaum, E.A. (Eds), Handbook of Artificial Intelligence, volume IV (pp. 241–322). MA: Addison-Wesely, Reading.Google Scholar
  17. Lu, S. (1979). A tree-to-tree distance and its application to cluster analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-1(2), 219–224.Google Scholar
  18. Newell, A. (1991). Unifyied Theories of Cognition. Cambridge, MA: Cambridge University Press.Google Scholar
  19. Novick, L.R. and Holyoak, K.J. (1991). Mathematical problem solving by analogy. Journal of Experimental Psychology: Learning, Memory, and Cognition, 14, 510–520.CrossRefGoogle Scholar
  20. Nilsson, N.J. (1980). Principles of Artificial Intelligence. Springer.Google Scholar
  21. Novick, L.R. (1988). Analogical transfer, problem similarity, and expertise. Journal of Experimental Psychology: Learning, Memory, and Cognition, 14, 510–520.CrossRefGoogle Scholar
  22. Newell, A. and Simon, H.A. (1972). Human Problem Solving. NJ: Prentice Hall, Englewood Cliffs.Google Scholar
  23. Rumelhart, D.E. and Norman, D.A. (1981). Analogical processes in learning. In Anderson, J.R. (Ed.), Cognitive Skills and Their Acquisition, (pp. 335–360). Hillsdale, NJ: Lawrence Erlbaum.Google Scholar
  24. Rosenbloom, P.S. and Newell, A. (1986). The chunking of goal hierarchies: A generalized model of practice. In Michalski, R.S., Carbonell, J.G. and Mitchell, T.M. (Eds.), Machine Learning-An Artificial Intelligence Approach, volume 2 (pp. 247-288). Morgan Kaufmann.Google Scholar
  25. Simon, R.J. (1970). Encoding effects on complex problem solving. Journal of Experimental Psychology, 83, 227–231.CrossRefGoogle Scholar
  26. Schmid, U. and Kaup, B. (1995). Analoges Lernen beim rekursiven Programmieren (Analogical learning in recursive programming). Kognitionswissenschaft, 5, 31–41.CrossRefGoogle Scholar
  27. Summers, P.D. (1977). A methodology for LISP program construction from examples. Journal ACM, 24(1), 162–175.CrossRefGoogle Scholar
  28. Schmid, U. and Wysotzki, F. (1996). Fertigkeitserwerb durch induktive Programmsynthese und generalisiertes Planen. In Dilger, W., Schlosser, M., Zeidel, J. and Ittner, A. (Hrsg.), Proceedings of FCML-96 (19.-21.8.96, TU Chemnitz), 106-111.Google Scholar
  29. Unger, S. and Wysotzki, F. (1981). Lernfähige Klassifizierungssysteme. Berlin: Akademie-Verlag.Google Scholar
  30. Vorberg, D. and Göbel, R. (1991). Das Lösen rekursiver Programmierprobleme: Rekursionsschemata. Kognitionswissenschaft, 1, 83–95.Google Scholar
  31. Vosniadou, S. and Ortony, A. (1989). Similarity and analogical reasoning: A synthesis. In S. Vosniadou and A. Ortony (eds.), Similarity and Analogical Reasoning, Cambridge: Cambridge University Press, 1–17.CrossRefGoogle Scholar
  32. Weber, G. (1994). Examples and remindings in a case-based help system. In Proc. of the 2nd Enropean Workshop on Case-Based Reasoning (Chantilly, France, Nov. 94).Google Scholar
  33. Weber, G. (1994). Fallbasiertes Lernen und Analogien-Unterstützung von Problemlöse-und Lernprozessen in einem adaptiven Lernsystem. Weinheim: PVU.Google Scholar
  34. Wysotzki, F. (1983). Representation and induction of infinite concepts and recursive action sequences. In Proceedings of the 8th IJCAI Karlsruhe.Google Scholar
  35. Wysotzki, F. (1987). Program synthesis by hierarchical planning. In P. Jorrand and V. Sgurev, (Eds.), Artificial Intelligence: Methodology, Systems, Applications, (pp. 3–11). Amsterdam: Elsevier Science.Google Scholar

Copyright information

© Deutscher Universitäts-Verlag GmbH, Wiesbaden 1997

Authors and Affiliations

  • Ute Schmid
  • Fritz Wysotzki

There are no affiliations available

Personalised recommendations