Applying Inductive Program Synthesis to Macro Learning

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 371-378

  Schmid, Ute ^a   Wysotzki, Fritz ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER GAMES;

INDUCTIVE PROGRAM SYNTHESIS; MACRO LEARNING; MACRO-OPERATORS; PROBLEM DOMAIN; RECURSIVE PROGRAM SCHEMES; SUBGOALS;

ROCKETS;

EID: 8344268848     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Borrajo, D., and Veloso, M. 1996. Lazy incremental learning of control knowledge for efficiently obtaining quality plans. AI Review Journal 10:1-34.
2. Christofides, N. 1975. Graph Theory - An Algorithmic Approach. London: Aceidemic Press.
3. Cohen, W. 1998. Hardness results for learning first-order representations and programming by demonstration. Machine Learning 30:57-97.
4. Courcellc, B., and Nivat, M. 1978. The algebraic semantics of recursive program schemes. In Winkowski, ed., Math. Foundations of Computer Science, Springer LNCS. 16-30.
5. Dershowitz, N ., and Jouanaud, J . - P . 1990. Rewrite systems. In Leeuwen, J ., cd.. Handbook of Theoretical Computer Science, volume B. Elsevier.
6. Field, A., and Harrison, P. 1988. Functional Progamming. Reading, MA: Addison-Wesley.
7. Flencr, P., and Yilmaz, S. 1999. Inductive synthesis of recursive logic programs: Achievements and prospects. Journal of Logic Programming 41(2-3):141-195.
8. Kalmeir, Z., and Szepesvari, C. 1999. An evaluation criterion for mcicro leeirniiig and some results. TR99-01, Mind-maker Ltd.
9. Kaplan, C, and Simon, H. 1990. In search of insight. Cognitive Psychology 22:374-419.
10. Klahr, D. 1978. Goal formation, planning, and learning by preschool problem solvers or: "my socks are in the dryer". In Children's thinking: What develops? Erlbaum.
11. Koehler, J. 1998. Pleinning under resource constraints. In Prade, H., ed., 13th ECAI. Wiley.
12. Korf, R.E. 1985. Macro-operators: a weak method for learning. Artificial Intelligence, 1985 26:35-77.
13. Koza, J. 1992. Genetic programming: On the programming of computers by means of natural selection. M I T Press.
14. Le Blanc, G. 1994. B M W k revisited: GeneraUzation and formalization of an algorithm for detecting recursive relations in term sequences. In Bergetdano, F ., and de Raedt, L ., eds., ECML-94, 183-197. Springer.
15. Manna, Z., and Waldinger, R. 1975. Knowledge ¿uid rear soning in program synthesis. Artificial Intelligence 6:175-208.
16. Manna, Z., and Waldinger, R. 1987. How to clear a block: a theory of plans. /. of Automated Reasoning 3{4):343-37S. Minton, S. 1985. Selectively generalizing plans for problem-solving. In Proc. of the IJCAI-85, 596-599. Morgan Kaufmann.
17. Peot, M., and Smith, D. 1992. Conditional nonlinear planning. In AIPS-92, 189-197. Morgan Kaufmann.
18. Plotlíin, G. D. 1970. A note on inductive generalization. Machine Intelligence, Edinburgh Univ. Press 5:153 163.
19. Precup, D., and Sutton, R. 1998. Multi-lime models for temporally abstract planning. In Advances in Neural Information Processing Systems, vol. 10. M I T Press.
20. Schmid, U ., and Wysotzki, F. 1998. Induction of recursive program schemes. In Proc. of the ECML-98, number 1398 in L N A I, 214-225. Springer.
21. Schmid, U, 1999. Iterative macro-operators revisited: Applying program synthesis to learning in planning. T. R. CMU-CS-99-114, Carnegie Mellon University.
22. Schoppers, M. 1987. Universal plans for reactive robots in unpredictable environments. In IJCAI '87, 1039-1046. ShavUk, J. W. 1990. Acquiring recursive and iterative concepts with explanation-based learning. Machine Learning 5:39-70.
23. Shell, P., and Carbonell, J. 1989. Towards a general framework for composing disjunctive and iterative macro-operators. In nth IJCAI-89.
24. Smith, D. R. 1990. Kids: a semiautomatic program development system. IEEE Transactions on Software Engineering 16(9);1024-1043.
25. Summers, P. D. 1977. A methodology for LISP program construction from examples. Journal ACM 24(1):162-175.
26. Sun, R., and Sessions, C. 1999. Self-segmentation of sequences: Automatic formation of hiereu-chies of sequential behaviors. T. R. 609-951-2781, N E C Research Institute, Princeton.
27. Veloso, M. M., and Carbonell, J. G. 1993. Derivational analogy in Prodigy: Automating case acquisition, storage, and utilization. Machine Learning 10:249-278.
28. Veloso, M.; Carbonell, J .; Pérez, M. A.; Borrajo, D.; Fink, E .; and Blythe, J. 1995. Integrating planning and learning: The Prodigy architecture. Journal of Experimental and Theoretical Artificial Intelligence 7(1):81-120.
29. Wysotzki, F. 1983. Representation and induction of infinite concepts and recursive 2tction sequences. In Proc. of the 8th IJCAL
30. Wysotzki, F. 1987. Program synthesis by hierarchical planning. In Jorrand, P., and Sgurev, V., eds.. Artificial Intelligence: Methodology, Systems, Applications. Elsevier. 3-11.